Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
From MaRDI portal
Publication:1850844
DOI10.1023/A:1012752110010zbMath1172.90501OpenAlexW110673842MaRDI QIDQ1850844
Publication date: 15 December 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012752110010
Related Items (35)
Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Unboundedness in reverse convex and concave integer programming ⋮ Q-subdifferential and Q-conjugate for global optimality ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Sufficient global optimality conditions for weakly convex minimization problems ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Global optimality conditions for cubic minimization problem with box or binary constraints ⋮ Global minimization of difference of quadratic and convex functions over box or binary constraints ⋮ Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators ⋮ Semidefinite program duals for separable polynomial programs involving box constraints ⋮ Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints ⋮ Global optimality conditions for some classes of optimization problems ⋮ Sufficient global optimality conditions for bivalent quadratic optimization ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions ⋮ Mathematical properties of optimization problems defined by positively homogeneous functions ⋮ Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma ⋮ Conditions for boundedness in concave programming under reverse convex and convex constraints ⋮ Optimality conditions in global optimization and their applications ⋮ On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball ⋮ Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint ⋮ FROM SMILE ASYMPTOTICS TO MARKET RISK MEASURES ⋮ Global optimality conditions for nonlinear programming problems with linear equality constraints ⋮ Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints ⋮ A secure control framework for resource-limited adversaries ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
This page was built for publication: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
