Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere

DOI10.1007/978-3-319-08377-3_16zbMath1327.90164OpenAlexW190960980MaRDI QIDQ2942468

David Yang Gao, Yi Chen

Publication date: 11 September 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08377-3_16

zbMATH Keywords

global optimizationcanonical duality theorytrust region subproblemquadratic minimization problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• On trust region methods for unconstrained minimization without derivatives
• Canonical duality theory and solutions to constrained nonconvex quadratic programming
• Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Duality principles in nonconvex systems. Theory, methods and applications
• On the triality theory for a quartic polynomial optimization problem
• Solutions and optimality criteria to box constrained nonconvex minimization problems
• Complete solutions and extremality criteria to polynomial optimization problems
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Minimizing a Quadratic Over a Sphere
• Geometric nonlinearity: potential energy, complementary energy, and the gap function
• Canonical Dual Solutions for Fixed Cost Quadratic Programs
• Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
• Computing a Trust Region Step
• Computing Optimal Locally Constrained Steps
• Newton’s Method with a Model Trust Region Modification
• Numerical Optimization
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Perfect duality theory and complete solutions to a class of global optimization problems*
• Trust Region Methods
• The trust region subproblem and semidefinite programming*
• Solving the Trust-Region Subproblem using the Lanczos Method
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
• Unnamed Item

This page was built for publication: Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere