On second-order optimality conditions for nonlinear programming
From MaRDI portal
Publication:5426957
DOI10.1080/02331930701618617zbMath1172.90490OpenAlexW2045497213MaRDI QIDQ5426957
María Laura Schuverdt, José Mario Martínez, Roberto Andreani
Publication date: 16 November 2007
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701618617
Related Items
Second-order negative-curvature methods for box-constrained and general constrained optimization, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Second-order optimality conditions for mathematical programs with equilibrium constraints, Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming, Constant-rank condition and second-order constraint qualification, An extension of Yuan's lemma and its applications in optimization, On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier, 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, First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, A simple canonical form for nonlinear programming problems and its use, 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, Fréchet Second-Order Subdifferentials of Lagrangian Functions and Optimality Conditions, On second-order optimality conditions for vector optimization, On approximate KKT condition and its extension to continuous variational inequalities, Robust registration of point sets using iteratively reweighted least squares, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, On a conjecture in second-order optimality conditions, A stabilized SQP method: superlinear convergence, A new result on second-order necessary conditions for nonlinear programming, An application of matrix computations to classical second-order optimality conditions, A note on linearly dependent symmetric matrices, On strong and weak second-order necessary optimality conditions for nonlinear programming, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, On second-order optimality conditions in nonlinear optimization, Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
Uses Software
Cites Work
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- Perturbations of extremal problems with constraints and necessary optimality conditions
- A note on the convergence of barrier algorithms to second-order necessary points
- An augmented Lagrangian interior-point method using directions of negative curvature
- On the solution of mathematical programming problems with equilibrium constraints
- Feasible interior methods using slacks for nonlinear optimization
- On the classical necessary second-order optimality conditions
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Euler discretization and inexact restoration for optimal control
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Multiplier and gradient methods
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- Lagrange Multipliers and Optimality
- Solution point differentiability without strict complementarity in nonlinear programming
- CONDITIONS OF HIGH ORDER FOR A LOCAL MINIMUM IN PROBLEMS WITH CONSTRAINTS
- Penalty methods for computing points that satisfy second order necessary conditions
- Numerical Optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- Trust Region Methods
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- A Globally Convergent Filter Method for Nonlinear Programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Interior Methods for Nonlinear Optimization
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Classical Necessary Second-Order Optimality Conditions in the Presence of Equality and Inequality Constraints
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
