A line search exact penalty method using steering rules
From MaRDI portal
Publication:431002
DOI10.1007/s10107-010-0408-0zbMath1254.90221OpenAlexW2079309016MaRDI QIDQ431002
Gabriel Lopez-Calva, Byrd, Richard H., Nocedal, Jorge
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0408-0
ConvergenceSequential quadratic programmingExact penalty methodLine searchSteering rulesTrust region
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming, A line search penalty-free method for nonlinear second-order cone programming, Exact penalty functions and convex extensions of functions in schemes of decomposition in variables, A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition, A stabilized filter SQP algorithm for nonlinear programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, An M-objective penalty function algorithm under big penalty parameters, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, Exact Penalization of Generalized Nash Equilibrium Problems, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, Global optimality conditions and exact penalization, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, On the use of piecewise linear models in nonlinear programming, An exact penalty approach for optimization with nonnegative orthogonality constraints, Minimizing sequences in a constrained DC optimization problem, Unnamed Item, An SQP method for minimization of locally Lipschitz functions with nonlinear constraints, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization, An adaptive augmented Lagrangian method for large-scale constrained optimization, A line search exact penalty method with bi-object strategy for nonlinear constrained optimization, A local search method for optimization problem with d.c. inequality constraints, On a Solving Bilevel D.C.-Convex Optimization Problems, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, A line search exact penalty method for nonlinear semidefinite programming, Problems related to estimating the coefficients of exact penalty functions, A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- Interior-point algorithms, penalty methods and equilibrium problems
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Convex analysis and nonlinear optimization. Theory and examples
- Failure of global convergence for a class of interior point methods for nonlinear programming
- A robust sequential quadratic programming method
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- Steering exact penalty methods for nonlinear programming
- Exact penalty functions in nonlinear programming
- Engineering and Economic Applications of Complementarity Problems
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- Optimization of Convex Risk Functions
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Nonlinear programming without a penalty function.
