Results 111 to 120 of about 3,006 (163)

Multi-adaptive event-triggered consensus of positive multi-agent systems using pinning strategy. [PDF]

PLoS One
Li Q, Dong L, Yang H.
europepmc   +1 more source

HBSP: a hybrid bilinear and semidefinite programming approach for aligning partially overlapping point clouds. [PDF]

Sci Rep
Lian W, Ma F, Cui Z, Pan H.
europepmc   +1 more source

Adaptive linear MPC for a PMSM-driven autonomous EV with a filtered third-order generalized integrator observer. [PDF]

Sci Rep
Ismail MM, Al-Dhaifallah M, Rezk H, Refaat MM, Junejo AK.   +4 more
europepmc   +1 more source

Many photonic design problems are sparse QCQPs. [PDF]

Sci Adv
Gertler S, Kuang Z, Christie C, Li H, Miller OD.   +4 more
europepmc   +1 more source

Algorithms for convex quadratic programming

, 2018
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quadratic convex reformulation for quadratic programming with linear on–off constraints

European Journal of Operational Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Duan Li, Rujun Jiang, Baiyi Wu
exaly   +3 more sources

On Some Properties of Quadratic Programs with a Convex Quadratic Constraint

SIAM Journal on Optimization, 1998
Summary: We consider the problem of minimizing a (possibly nonconvex) quadratic function with a quadratic constraint. We point out some new properties of the problem. In particular, in the first part of the paper, we show that (i) given a KKT point that is not a global minimizer, it is easy to find a ``better'' feasible point; (ii) strict ...
LUCIDI, Stefano, PALAGI, Laura, ROMA, Massimo   +2 more
openaire   +3 more sources

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

Optimization Methods and Software, 2013
Nonconvex quadratic constraints can be linearized to obtain relaxations in a well-understood manner. We propose to tighten the relaxation by using second-order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds.
John E. Mitchell 0001, Jong-Shi Pang, Bin Yu   +2 more
openaire   +1 more source

Convex Quadratic Programming for Object Localization

18th International Conference on Pattern Recognition (ICPR'06), 2006
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very little texture, and in strong background clutter; traditional methods have great difficulty in such situations. We propose a convex quadratic programming (CQP) relaxation method
Hao Jiang 0007, Mark S. Drew, Ze-Nian Li
openaire   +1 more source

Image segmentation by convex quadratic programming

2008 19th International Conference on Pattern Recognition, 2008
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported quadratic Markov measure field model can be neglected and the solution preserves the probability measure property. This allows one to design efficient optimization algorithms.
Mariano Rivera, Oscar Dalmau Cedeño, Josue Tago   +2 more
openaire   +1 more source