Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems

DOI10.2298/YJOR170119012RzbMath1474.90320OpenAlexW2624525523MaRDI QIDQ4987691

Sudipta Roy, Sandip Chatterjee, R. N. Mukherjee

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor170119012r

zbMATH Keywords

quadratic formssemidefinite matricesLagrangian duality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Branch-and-bound approaches to standard quadratic optimization problems
• Handbook of global optimization
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Separable standard quadratic optimization problems
• Unconstrained formulation of standard quadratic optimization problems
• Quartic formulation of standard quadratic optimization problems
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Semidefinite Optimization and Convex Algebraic Geometry
• Convex Analysis
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

This page was built for publication: Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems