Exact penalty function algorithm with simple updating of the penalty parameter
From MaRDI portal
Publication:2277155
Cites work
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A globally convergent method for nonlinear programming
- A surperlinearly convergent algorithm for constrained optimization problems
- 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
- The watchdog technique for forcing convergence in algorithms for constrained optimization
Cited in
(33)- An update rule and a convergence result for a penalty function method
- An SQP method for general nonlinear programs using only equality constrained subproblems
- A reduced Hessian SQP method for inequality constrained optimization
- A modified SQP algorithm for minimax problems
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A practical update criterion for SQP method
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A cautious BFGS update for reduced Hessian SQP
- Decentralized Cooperative Optimization for Multi-criteria Decision Making
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- A robust SQP method based on a smoothing lower order penalty function†
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- A superlinearly convergent hybrid algorithm for solving nonlinear programming
- A sequential quadratically constrained quadratic programming method of feasible directions
- A sequential quadratic programming algorithm for nonlinear minimax problems
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- Convergence of the BFGS-SQP Method for Degenerate Problems
- A simple feasible SQP algorithm for inequality constrained optimization
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
- A two-parameter exact penalty function for nonlinear programming
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A new technique for inconsistent QP problems in the SQP method
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
This page was built for publication: Exact penalty function algorithm with simple updating of the penalty parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277155)
