Second-order negative-curvature methods for box-constrained and general constrained optimization
From MaRDI portal
Publication:2379692
DOI10.1007/S10589-009-9240-YzbMATH Open1187.90265OpenAlexW1978804995MaRDI QIDQ2379692FDOQ2379692
Authors: E. G. Birgin, R. Andreani, J. M. Martínez, María Laura Schuverdt 
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
Recommendations
- scientific article; zbMATH DE number 1694901
- A boxed optimization reformulation for the convex second order cone programming
- Box-constrained minimization reformulations of complementarity problems in second-order cones
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- A second-order gradient method for convex minimization
- Second-order optimality conditions for constrained domain optimization
- scientific article; zbMATH DE number 653038
- An alternating direction method for second-order conic programming
- On second-order sufficient conditions in constrained nonsmooth optimization
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
Cites Work
- 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
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Algorithm 813
- CUTEr and SifDec
- Numerical Optimization
- Title not available (Why is that?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Multiplier and gradient methods
- Title not available (Why is that?)
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Lagrange Multipliers and Optimality
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Trust Region Methods
- Convergence to second-order stationary points in inequality constrained optimization
- A New Active Set Algorithm for Box Constrained Optimization
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- 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
- Title not available (Why is that?)
- Newton’s Method with a Model Trust Region Modification
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Inexact spectral projected gradient methods on convex sets
- On second-order optimality conditions for nonlinear programming
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- CONDITIONS OF HIGH ORDER FOR A LOCAL MINIMUM IN PROBLEMS WITH CONSTRAINTS
- On the use of directions of negative curvature in a modified newton method
- A modification of Armijo's step-size rule for negative curvature
- A new trust-region algorithm for equality constrained optimization
- A Projection-Based Algorithm for Consistent and Inconsistent Constraints
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
Cited In (29)
- Convergence results of an augmented Lagrangian method using the exponential penalty function
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- A two-stage active-set algorithm for bound-constrained optimization
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Finding graph embeddings by incremental low-rank semidefinite programming
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Convergence properties of a second order augmented Lagrangian method for mathematical programs with complementarity constraints
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- An active set feasible method for large-scale minimization problems with bound constraints
- Title not available (Why is that?)
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Second-order enhanced optimality conditions and constraint qualifications
- Complexity and performance of an augmented Lagrangian algorithm
- On the Burer-Monteiro method for general semidefinite programs
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- A Note on the McCormick Second-Order Constraint Qualification
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Using negative curvature in solving nonlinear programs
- Total variation based community detection using a nonlinear optimization approach
- A novel projected gradient-like method for optimization problems with simple constraints
- A new algorithm for highly curved constrained optimisation
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient
- Constant-rank condition and second-order constraint qualification
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
Uses Software
This page was built for publication: Second-order negative-curvature methods for box-constrained and general constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379692)
