Exact penalty function algorithm with simple updating of the penalty parameter
From MaRDI portal
Publication:2277155
DOI10.1007/BF00940684zbMath0724.90065MaRDI QIDQ2277155
J. F. A. de O. Pantoja, David Q. Mayne
Publication date: 1991
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
constrained minimizationexact penalty functionquadratic programming subproblemequality and inequality constraintsQ-superlinear rate of convergencesequential quadratic programming algorithms
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (32)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A two-parameter exact penalty function for nonlinear programming ⋮ A modified SQP algorithm for minimax problems ⋮ A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ Convergence of the BFGS-SQP Method for Degenerate Problems ⋮ A simple feasible SQP algorithm for inequality constrained optimization ⋮ An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point ⋮ A cautious BFGS update for reduced Hessian SQP ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ A smoothing QP-free infeasible method for nonlinear inequality constrained optimization ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ A practical update criterion for SQP method ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A robust SQP method based on a smoothing lower order penalty function† ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ An SQP algorithm with cautious updating criteria for nonlinear degenerate problems ⋮ An SQP method for general nonlinear programs using only equality constrained subproblems ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ A new technique for inconsistent QP problems in the SQP method ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Uses Software
Cites Work
- Unnamed Item
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A globally convergent method for nonlinear programming
- A surperlinearly convergent algorithm for constrained optimization problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Quasi-Newton Methods, Motivation and Theory
This page was built for publication: Exact penalty function algorithm with simple updating of the penalty parameter