Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
From MaRDI portal
(Redirected from Publication:985310)
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
Cites work
- scientific article; zbMATH DE number 994348 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- A note on diagonally dominant matrices
- Abstract convexity and global optimization
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- Conditions for global optimality. II
- Construction of test problems in quadratic bivalent programming
- Convexity of quadratic transformations and its use in control and optimization
- Dual conditions characterizing optimality for convex multi-objective programs.
- Global optimality conditions for nonconvex optimization
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Handbook of global optimization
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Necessary and sufficient global optimality conditions for convex maximization revisited
- On the S-procedure and some variants
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- The strong conical hull intersection property for convex programming
Cited in
(65)- 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
- A note on sufficient global optimality conditions for fixed charge quadratic programs
- Sufficient global optimality conditions for weakly convex minimization problems
- 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
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- scientific article; zbMATH DE number 823384 (Why is no real title available?)
- 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
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- Characteristics of semi-convex frontier optimization
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- scientific article; zbMATH DE number 6531344 (Why is no real title available?)
- Global infimum of strictly convex quadratic functions with bounded perturbations
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- 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
- Global optimality condition for quadratic optimization problems under data uncertainty
- Unified global optimality conditions for smooth minimization problems with mixed variables
- Global optimality conditions for mixed nonconvex quadratic programs†
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- On stability of solutions to parametric generalized affine variational inequalities
- 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 cubic minimization problems with cubic constraints
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
- 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
- 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
- Global optimality conditions and optimization methods for quadratic integer programming problems
- A filled function method for quadratic programs with binary constraints†
- Global optimality of quadratic minimization over symmetric polytopes
- Sufficient conditions for global optimality of semidefinite optimization
- Glogal optimality conditions for classes of non-convex multi-objective quadratic optimization problems
- 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
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
- 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)
