Some theoretical limitations of second-order algorithms for smooth constrained optimization
From MaRDI portal
(Redirected from Publication:2417153)
Recommendations
- A second-order smooth penalty function algorithm for constrained optimization problems
- On second-order sufficient conditions in constrained nonsmooth optimization
- An inexact smoothing algorithm for solving second-order cone programming problems
- Second-Order Necessary Conditions in Constrained Semismooth Optimization
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- On second-order conditions in unconstrained optimization
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- scientific article; zbMATH DE number 2143167
- On second-order conditions for nonsmooth problems with constraints
- scientific article; zbMATH DE number 880247
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 7000312 (Why is no real title available?)
- A cone-continuity constraint qualification and algorithmic consequences
- A note on the convergence of barrier algorithms to second-order necessary points
- A second-order sequential optimality condition associated to the convergence of optimization algorithms
- A stabilized SQP method: global convergence
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- On a conjecture in second-order optimality conditions
- On second-order optimality conditions for nonlinear programming
- On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
- On the complexity of approximating a KKT point of quadratic programming
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Set-valued analysis
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
Cited in
(6)- Global convergence of a second-order augmented Lagrangian method under an error bound condition
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- 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
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)
