Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
From MaRDI portal
Publication:985310
DOI10.1007/S10107-006-0012-5zbMATH Open1206.90178OpenAlexW2091480518MaRDI QIDQ985310FDOQ985310
Authors: V. Jeyakumar, A. M. Rubinov, Zhiyou Wu 
Publication date: 21 July 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0012-5
Recommendations
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- Global optimality conditions for quadratic optimization problems with binary constraints
Quadratic programming (90C20) Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)
Cites Work
- Global optimality conditions for nonconvex optimization
- Conditions for global optimality. II
- Handbook of global optimization
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Convexity of quadratic transformations and its use in control and optimization
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
- Title not available (Why is that?)
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- Sufficient global optimality conditions for bivalent quadratic optimization
- On the S-procedure and some variants
- Abstract convexity and global optimization
- A note on diagonally dominant matrices
- Title not available (Why is that?)
- The strong conical hull intersection property for convex programming
- Dual conditions characterizing optimality for convex multi-objective programs.
- Construction of test problems in quadratic bivalent programming
Cited In (65)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Characteristics of semi-convex frontier optimization
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
- Semidefinite program duals for separable polynomial programs involving box constraints
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- On zero duality gap in nonconvex quadratic programming problems
- Optimization methods for mixed integer weakly concave programming problems
- Global optimality conditions for nonlinear programming problems with linear equality constraints
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- The unconstrained binary quadratic programming problem: a survey
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
- Sufficient global optimality conditions for weakly convex minimization problems
- A note on sufficient global optimality conditions for fixed charge quadratic programs
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Global optimality conditions for some classes of optimization problems
- Global optimality conditions for quadratic \(0-1\) optimization problems
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Title not available (Why is that?)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Title not available (Why is that?)
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Global infimum of strictly convex quadratic functions with bounded perturbations
- On a quadratic minimization problem with nonuniform perturbations in the criteria and constraints
- \(Q\)-subdifferential and \(Q\)-conjugate for global optimality
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- Unified global optimality conditions for smooth minimization problems with mixed variables
- Global optimality conditions for mixed nonconvex quadratic programs†
- Global optimality condition for quadratic optimization problems under data uncertainty
- On stability of solutions to parametric generalized affine variational inequalities
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Global optimality conditions for fixed charge quadratic programs
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Global optimality conditions for cubic minimization problems with cubic constraints
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- A filled function method for quadratic programs with binary constraints†
- Global optimality of quadratic minimization over symmetric polytopes
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Glogal optimality conditions for classes of non-convex multi-objective quadratic optimization problems
- Sufficient conditions for global optimality of semidefinite optimization
- Global sufficient optimality conditions for a special cubic minimization problem
- Optimality conditions for the minimization of quadratic \(0-1\) problems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
- On quadratically constrained quadratic optimization problems and canonical duality theory
- Nonconvex minimization of a quadratic function over a sphere
- Nonconvex piecewise-quadratic underestimation for global minimization
- Optimality conditions and optimization methods for quartic polynomial optimization
- D.C. programming approach for solving an applied ore-processing problem
This page was built for publication: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985310)
