scientific article; zbMATH DE number 4114401
[For the entire collection see Zbl 0595.00027.] The authors present two classes of algorithms for constrained optimization problems. The first class is based on a continuously differentiable exact penalty function with an additional barrier term. The second class is based on a modification of a continuously differentiable exact augmented Lagrangian function. An automatic adjustment rule for the penalty parameter is described which ensures global convergency, thus overcoming the main drawback of existing exact penalty function methods. The algorithms are illustrated with several test problems.
- scientific article; zbMATH DE number 778133
- Constrained global optimization using a new exact penalty function
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- Exact Penalty Functions in Constrained Optimization
- New exact penalty functions for nonlinear constrained optimization problems
- New results on a class of exact augmented Lagrangians
- On the role of continuously differentiable exact penalty functions in constrained global optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Global optimality conditions and exact penalization
- Constrained global optimization using a new exact penalty function
- scientific article; zbMATH DE number 4152163 (Why is no real title available?)
- An exact penalty function method with global convergence properties for nonlinear programming problems
- scientific article; zbMATH DE number 4049400 (Why is no real title available?)
- Multiplier methods for engineering optimization
- A line search exact penalty method using steering rules
- scientific article; zbMATH DE number 1568997 (Why is no real title available?)
- scientific article; zbMATH DE number 778133 (Why is no real title available?)
- Global and local convergence of a penalty-free method for nonlinear programming
- A globally convergent regularized interior point method for constrained optimization
- Solving constrained global optimization problems without penalty parameters
- Global Optimization and Constraint Satisfaction
- Constraint aggregation for rigorous global optimization
- A smooth method for the finite minimax problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729626)