Results 91 to 100 of about 1,126 (142)
, 2018 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Solution existence and stability of quadratically constrained convex quadratic programs
Optimization Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Do Sang Kim, Kim D S, N D Yen
exaly +3 more sources
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
SIAM Journal on Optimization, 1998Summary: 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 +2 more
openaire +3 more sources
Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Optimization Methods and Software, 2013Nonconvex 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 +2 more
openaire +1 more source
Convex Quadratic Programming for Object Localization
18th International Conference on Pattern Recognition (ICPR'06), 2006We 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, 2008A 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 +2 more
openaire +1 more source
Lifted Inference for Convex Quadratic Programs
Proceedings of the AAAI Conference on Artificial Intelligence, 2017Symmetry is the essential element of lifted inferencethat has recently demonstrated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models. This raises the question, whether this holds for optimization problems in general.Here we show that for a large classof optimization methods this
Martin Mladenov +2 more
openaire +1 more source
Convex Quadratic Programming Approach
Journal of Global Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Convex Relaxations of (0, 1)-Quadratic Programming
Mathematics of Operations Research, 1995We consider three parametric relaxations of the (0, l)-quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix.
Svatopluk Poljak, Henry Wolkowicz
openaire +1 more source
Quadratic convex reformulation for quadratic programming with linear on–off constraints
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baiyi Wu, Duan Li 0002, Rujun Jiang
openaire +2 more sources