Some theoretical limitations of second-order algorithms for smooth constrained optimization
From MaRDI portal
Publication:2417153
DOI10.1016/J.ORL.2018.02.007OpenAlexW2791878539WikidataQ111288286 ScholiaQ111288286MaRDI QIDQ2417153FDOQ2417153
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 convergencesecond-order optimality conditionsconstant rankconstraint qualificationsecond-order algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Set-valued analysis
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- A note on the convergence of barrier algorithms to second-order necessary points
- On second-order optimality conditions for nonlinear programming
- On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
- A stabilized SQP method: global convergence
- 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
- A second-order sequential optimality condition associated to the convergence of optimization algorithms
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
Cited In (4)
- 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
- A second-order smooth penalty function algorithm for constrained optimization problems
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On second-order conditions in unconstrained optimization 👍 👎
- Second-Order Necessary Conditions in Constrained Semismooth Optimization 👍 👎
- A second-order smooth penalty function algorithm for constrained optimization problems 👍 👎
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems 👍 👎
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods 👍 👎
- On second-order conditions for nonsmooth problems with constraints 👍 👎
This page was built for publication: Some theoretical limitations of second-order algorithms for smooth constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417153)
