Second-order negative-curvature methods for box-constrained and general constrained optimization
From MaRDI portal
Publication:2379692
DOI10.1007/s10589-009-9240-yzbMath1187.90265OpenAlexW1978804995MaRDI QIDQ2379692
Ernesto G. Birgin, José Mario Martínez, María Laura Schuverdt, Roberto Andreani
Publication date: 19 March 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.8945
Related Items
A two-stage active-set algorithm for bound-constrained optimization, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Finding graph embeddings by incremental low-rank semidefinite programming, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Constant-rank condition and second-order constraint qualification, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, An active set feasible method for large-scale minimization problems with bound constraints, Some theoretical limitations of second-order algorithms for smooth constrained optimization, Second-order enhanced optimality conditions and constraint qualifications, Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems, A novel projected gradient-like method for optimization problems with simple constraints, A Note on the McCormick Second-Order Constraint Qualification, On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming, A second-order convergence augmented Lagrangian method using non-quadratic penalty functions, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, On the Burer-Monteiro method for general semidefinite programs, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, Complexity and performance of an Augmented Lagrangian algorithm, Convergence results of an augmented Lagrangian method using the exponential penalty function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Multiplier and gradient methods
- Convergence to Second Order Stationary Points in Inequality Constrained Optimization
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- Lagrange Multipliers and Optimality
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- CONDITIONS OF HIGH ORDER FOR A LOCAL MINIMUM IN PROBLEMS WITH CONSTRAINTS
- Newton’s Method with a Model Trust Region Modification
- A modification of Armijo's step-size rule for negative curvature
- On the use of directions of negative curvature in a modified newton method
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Numerical Optimization
- A Projection-Based Algorithm for Consistent and Inconsistent Constraints
- Inexact spectral projected gradient methods on convex sets
- Trust Region Methods
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
- On second-order optimality conditions for nonlinear programming
- Algorithm 813
- CUTEr and SifDec
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- A new trust-region algorithm for equality constrained optimization
