Steering exact penalty methods for nonlinear programming

DOI10.1080/10556780701394169zbMath1211.90224OpenAlexW2090395694MaRDI QIDQ3539789

Richard A. Waltz, Nocedal, Jorge, Byrd, Richard H.

Publication date: 19 November 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780701394169

zbMATH Keywords

constrained optimizationnonlinear optimizationpenalty methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (31)

An inexact first-order method for constrained nonlinear optimization ⋮ Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates ⋮ A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results ⋮ A penalty-interior-point algorithm for nonlinear constrained optimization ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares ⋮ Exact Penalization of Generalized Nash Equilibrium Problems ⋮ 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 ⋮ A line search exact penalty method using steering rules ⋮ Switching stepsize strategies for sequential quadratic programming ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ An exact penalty-Lagrangian approach for large-scale nonlinear programming ⋮ Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ An interior-point piecewise linear penalty method for nonlinear programming ⋮ Global convergence of a robust filter SQP algorithm ⋮ 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 ⋮ Derivative-free nonlinear optimization filter simplex ⋮ Derivative-free optimization and filter methods to solve nonlinear constrained problems ⋮ Problems related to estimating the coefficients of exact penalty functions ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles

Uses Software

• SNOPT
• CONOPT
• Ipopt
• MINOS

Cites Work

• Unnamed Item
• Interior-point algorithms, penalty methods and equilibrium problems
• A trust region algorithm for equality constrained optimization
• Automatic decrease of the penalty parameter in exact penalty function methods
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• On the convergence of a new trust region algorithm
• Nonlinear programming and nonsmooth optimization by successive linear programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• An interior algorithm for nonlinear optimization that combines line search and trust region steps
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Exact penalty functions in nonlinear programming
• A Robust Trust Region Method for Constrained Nonlinear Programming Problems
• A Penalty Function Method Converging Directly to a Constrained Optimum
• On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
• Numerical Optimization
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
• Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Non-Linear Programming Via Penalty Functions
• An Exact Potential Method for Constrained Maxima
• Constrained Optimization Using a Nondifferentiable Penalty Function
• Nonlinear programming without a penalty function.

This page was built for publication: Steering exact penalty methods for nonlinear programming