On Some Properties of Quadratic Programs with a Convex Quadratic Constraint

Keywords

Karush–Kuhn–Tucker conditions, Mathematics, Piecewise, Quadratic equation, Quartic function

References

• Proving Polynomial-Time for Sphere-Constrained Quadratic ProgrammingStephen A. Vavasis, Richard Zippel — 1990
• On the use of directions of negative curvature in a modified newton methodJorge J. Morè, Danny C. Sorensen — 1979
• An Interior-Point Approach to NP-Complete ProblemsNarendra Karmarkar — 1990
• Fast algorithms for convex quadratic programming and multicommodity flowsSanjiv Kapoor, Pravin M. Vaidya — 1986
• A differentiable exact penalty function for bound constrained quadratic programming problemsLuigi Grippo, Stefano Lucidi — 1991
• Newton's method with a model trust region modificationD. C. Sorensen — 1982
• Lanczos algorithms for large symmetric eigenvalue computationsJane Cullum, Ralph A. Willoughby — 1985
• An extension of Karmarkar's projective algorithm for convex quadratic programmingYinyu Ye, Edison Tse — 1989
• A semidefinite framework for trust region subproblems with applications to large scale minimizationFranz Rendl, Henry Wolkowicz — 1997
• Truncated-newtono algorithms for large-scale unconstrained optimizationRon S. Dembo, Trond Steihaug — 1983
• Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsJames R. Bunch, Beresford Ν. Parlett — 1971
• On the Stationary Values of a Second-Degree Polynomial on the Unit SphereGeorge E. Forsythe, Gene H. Golub — 1965
• A truncated Newton method with nonmonotone line search for unconstrained optimizationLuigi Grippo, F. Lampariello, Stefano Lucidi — 1989
• A multiplier method with automatic limitation of penalty growthTorkel Glad, E. Polak — 1979
• On the solution of a two ball trust region subproblemMatthias Heinkenschloss — 1994
• Exact penalty functions in constrained optimizationGianni Di Pillo, Luigi Grippo — 1989
• Local Minimizers of Quadratic Functions on Euclidean Balls and SpheresJ. M. Martı́nez — 1994
• A nonmonotone line search technique for Newton's methodLuigi Grippo, F. Lampariello, Stefano Lucidi — 1986
• Algorithms for the solution of quadratic knapsack problemsPãnos M. Pardalos, Yinyu Ye, Chi-Geun Han — 1991
• Computing a Trust Region Step for a Penalty FunctionThomas F. Coleman, Christian Hempel — 1990

Cited by

• SPG: Software for Convex-Constrained OptimizationErnesto G. Birgin, J. M. Martı́nez, Marcos Raydan — 2008
• A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic ProblemsHoai An Le Thi, Pham Dinh Tao — 1998
• Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraintHarish J. Palanthandalam‐Madapusi, Tobin H. Van Pelt, Dennis S. Bernstein — 2009
• A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming ProblemsHoai An Le Thi, Pham Dinh Tao, Lê Dũng Mưu — 1998
• Trust Region Subproblem with a Fixed Number of Additional Linear Inequality Constraints has Polynomial ComplexityYong Hsia, Ruey-Lin Sheu — 2013
• An Exact Algorithm for Quadratic Integer Minimization using Nonconvex RelaxationsChristoph Buchheim, Marianna De Santis, Laura Palagi — 2012
• Box-constrained maximum-likelihood detection in CDMAPeng Hui Tan, Lars K. Rasmussen, Teng Joon Lim — 2000
• Coderivatives of a Karush–Kuhn–Tucker point set map and applicationsG.M. Lee, N. D. Yen — 2014
• Stability of Linear-Quadratic Minimization over Euclidean BallsG. M. Lee, Nguyen Nang Tam, N. D. Yen — 2012
• Nonmonotone Spectral Projected Gradient Methods on Convex SetsErnesto G. Birgin, J. M. Martı́nez, Marcos Raydan — 1999
• Algorithm 813: SPG—Software for Convex-Constrained OptimizationErnesto G. Birgin, J. M. Martı́nez, Marcos Raydan — 2001
• Quartic Formulation of Standard Quadratic Optimization ProblemsImmanuel M. Bomze, Laura Palagi — 2005
• Convergence of Pham Dinh–Le Thi’s algorithm for the trust-region subproblemHoàng Ngọc Tuấn, Nguyen Dong Yen — 2011
• Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region SubproblemCharles Fortin — 2005
• Ellipsoidal Approach to Box-Constrained Quadratic ProblemsP. L. De Angelis, Immanuel M. Bomze, Gerardo Toraldo — 2004
• TRUST-REGION-BASED METHODS FOR NONLINEAR PROGRAMMING: RECENT ADVANCES AND PERSPECTIVESSandra A. Santos — 2014
• A D.C. Optimization Algorithm for Solving the Trust-Region SubproblemPham Dinh Tao, Hoai An Le Thi — 1998
• Behavior of DCA sequences for solving the trust-region subproblemHoai An Le Thi, Tao Pham Dinh, Nguyen Dong Yen — 2012
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region SubproblemMarielba Rojas, Sandra A. Santos, Danny C. Sorensen — 2000
• On the ill-posedness of the trust region subproblemHoai An Le Thi, Pham Dinh Tao, Ðinh Nho Hào — 2003

Related papers

• Solving Definite Quadratic Bi-Objective Programming Problems by KKT ConditionsAmanu Gashaw — 2017
• Global Optimality Conditions for Quadratic Program Problems with Quadratic ConstraintsZhou Xue-gan — 2015
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone ProgrammingNaohiko Arima, Sunyoung Kim, Masakazu Kojima — 2013
• Parametric Pivoting Algorithm for Parametric Quadratic Programming ProblemYanwu Liu, Zhongzhen Zhang — 2009
• A Dynamical Systems Analysis of Semidefinite Programming with Application to Quadratic Optimization with Pure Quadratic Equality ConstraintsRobert Orsi — 1999
• On the solution of quadratic programming problemsStefan M. Stefanov — 2023
• A Fast Algorithm for Linearly Constrained Quadratic Programming Problems with Lower and Upper BoundsYanwu Liu, Zhongzhen Zhang — 2008