On second-order optimality conditions for nonlinear programming
From MaRDI portal
Publication:5426957
DOI10.1080/02331930701618617zbMath1172.90490MaRDI QIDQ5426957
María Laura Schuverdt, Roberto Andreani, José Mario Martínez
Publication date: 16 November 2007
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701618617
necessary optimality conditions; nonlinear programming; Constraint qualifications; Practical algorithms
Related Items
Constant-rank condition and second-order constraint qualification, On second-order optimality conditions for vector optimization, On approximate KKT condition and its extension to continuous variational inequalities, An application of matrix computations to classical second-order optimality conditions, Second-order negative-curvature methods for box-constrained and general constrained optimization
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.
