A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
From MaRDI portal
Publication:1576348
DOI10.1016/S0377-2217(99)00173-3zbMath0960.90091OpenAlexW2037997034MaRDI QIDQ1576348
Publication date: 14 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00173-3
Lagrange dualitytrust region subproblemsconvex quadratic programming with a convex quadratic constraintIll-posed least squares problems
Convex programming (90C25) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear M-estimation with bounded variables
- On \(\ell_ p\) programming
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- On piecewise quadratic Newton and trust region problems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Smoothing empirical functions by \(\ell _ p\) programming
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
- Optimal Truss Design by Interior-Point Methods
- A simple Duality Proof for Quadratically Constrained Entropy Functionals and Extension to Convex Constraints
- Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
- Convex Analysis
