Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
From MaRDI portal
Publication:620513
DOI10.1007/s10898-009-9518-8zbMath1230.90145MaRDI QIDQ620513
Guoyin Li, Vaithilingam Jeyakumar
Publication date: 19 January 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9518-8
linear equality constraints; strong duality; quadratic constraints; alternative theorems; quadratic nonconvex optimization; regularized Lagrangian; trust-region problems
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints, Generalized S-lemma and strong duality in nonconvex quadratic programming, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
Cites Work
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Definiteness and semidefiniteness of quadratic forms revisited
- On a subproblem of trust region algorithms for constrained optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A trust region algorithm for equality constrained optimization
- Handbook of global optimization. Vol. 2
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Nonsmooth vector functions and continuous optimization
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Partial Lagrangian relaxation for general quadratic programming
- Lectures on Modern Convex Optimization
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- On Local Solutions of the Celis--Dennis--Tapia Subproblem
- The trust region subproblem and semidefinite programming*
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
- On the mapping of quadratic forms
- A conic trust-region method for nonlinearly constrained optimization
- A new trust-region algorithm for equality constrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
