Results 41 to 50 of about 184,320 (288)
Imaging of Biphoton States: Fundamentals and Applications
Advanced Functional Materials, EarlyView.Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
An accelerating algorithm for globally solving nonconvex quadratic programming
Journal of Inequalities and Applications, 2018 To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj +1 more source
Hard‐Magnetic Soft Millirobots in Underactuated Systems
Advanced Robotics Research, EarlyView.This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
A Simple SQP Algorithm for Constrained Finite Minimax Problems
The Scientific World Journal, 2014 A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming.
Lirong Wang, Zhijun Luo
doaj +1 more source
Open Computer Science, 2020 The problem of maximizing a linear function with linear and quadratic constraints is considered. The solution of the problem is obtained in a constructive form using the Lagrange function and the optimality conditions.
Gorelik Victor, Zolotova Tatiana
doaj +1 more source
, 2017 Sequential Quadratic Programming (SQP) is a powerful class of algorithms for solving nonlinear optimization problems. Local convergence of SQP algorithms is guaranteed when the Hessian approximation used in each Quadratic Programming subproblem is close ...
Butler, Hans +2 more
core +1 more source
Consensus Formation and Change are Enhanced by Neutrality
Advanced Science, EarlyView.Neutral agents are shown to enhance both the formation and overturning of consensus in collective decision‐making. A general mathematical model and experiments with locusts and humans reveal that neutrality enables robust consensus via simple interactions and accelerates consensus change by reducing effective population size.
Andrei Sontag +3 more
wiley +1 more source
Energy Reports, 2020 Operation schedule for microgrids has an important role to manage the electric power supply and demand efficiently. This paper presents a problem formulation and its solution method to obtain a coordinated operation schedule of controllable components in
Hirotaka Takano +3 more
doaj +1 more source
An SDP Approach For Solving Quadratic Fractional Programming Problems [PDF]
, 2014 This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic ...
Nguyen, Van-Bong +2 more
core