Some theoretical limitations of second-order algorithms for smooth constrained optimization
From MaRDI portal
Publication:2417153
DOI10.1016/j.orl.2018.02.007WikidataQ111288286 ScholiaQ111288286MaRDI QIDQ2417153
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2018.02.007
global convergence; constraint qualification; second-order optimality conditions; constant rank; second-order algorithms
90-XX: Operations research, mathematical programming
Related Items
On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- A note on the convergence of barrier algorithms to second-order necessary points
- On the complexity of approximating a KKT point of quadratic programming
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- On a conjecture in second-order optimality conditions
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
- A stabilized SQP method: global convergence
- A second-order sequential optimality condition associated to the convergence of optimization algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- On second-order optimality conditions for nonlinear programming
- Set-valued analysis