Tilt stability for quadratic programs with one or two quadratic inequality constraints
DOI10.1007/S40306-020-00372-4zbMATH Open1453.90111OpenAlexW3036464408MaRDI QIDQ778159FDOQ778159
Authors: Le Van Hien, Nguyen Huy Chieu, Nguyen Thi Quynh Trang 
Publication date: 1 July 2020
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-020-00372-4
Recommendations
- Characterizations of tilt-stable minimizers in second-order cone programming
- Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
- Stability of a class of quadratic programs with a conic constraint
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Second-order characterizations of tilt stability with applications to nonlinear programming
quadratic programtilt stabilitymetric subregularity constraint qualificationquadratic inequality constraintstrong second-order sufficient condition
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Solving the Trust-Region Subproblem using the Lanczos Method
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trust Region Methods
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- On a subproblem of trust region algorithms for constrained optimization
- Quadratic programming and affine variational inequalities. A qualitative study.
- Stability of linear-quadratic minimization over Euclidean balls
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Tilt Stability of a Local Minimum
- The trust region subproblem and semidefinite programming*
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Stability of Locally Optimal Solutions
- Second-order characterizations of tilt stability with applications to nonlinear programming
- Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
- A study of tilt-stable optimality and sufficient conditions
- Title not available (Why is that?)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Convex analysis and global optimization
- On affine scaling algorithms for nonconvex quadratic programming
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- A note on polynomial solvability of the CDT problem
- Coderivatives related to parametric extended trust region subproblem and their applications
- On the complexity of quadratic programming with two quadratic constraints
- Solving generalized CDT problems via two-parameter eigenvalues
- Computation of Graphical Derivative for a Class of Normal Cone Mappings under a Very Weak Condition
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Globally solving the trust region subproblem using simple first-order methods
- Characterization of tilt stability via subgradient graphical derivative with applications to nonlinear programming
Cited In (1)
Uses Software
This page was built for publication: Tilt stability for quadratic programs with one or two quadratic inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778159)
