scientific article; zbMATH DE number 3520162
From MaRDI portal
Publication:4099846
zbMath0332.90039MaRDI QIDQ4099846
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items (55)
A trust region algorithm for nonsmooth optimization ⋮ New results on a class of exact augmented Lagrangians ⋮ Geometric approach to Fletcher's ideal penalty function ⋮ Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ An analysis of reduced Hessian methods for constrained optimization ⋮ Optimizing preventive maintenance models ⋮ A recursive quadratic programming algorithm that uses differentiable exact penalty functions ⋮ Exact penalty functions in nonlinear programming ⋮ Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities ⋮ Exact penalties for variational inequalities with applications to nonlinear complementarity problems ⋮ On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ Least squares with non-linear equality constraints. Application to closing of balances ⋮ A globally convergent, implementable multiplier method with automatic penalty limitation ⋮ A new augmented Lagrangian function for inequality constraints in nonlinear programming problems ⋮ Enlarging the region of convergence of Newton's method for constrained optimization ⋮ A primal-dual augmented Lagrangian ⋮ A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties ⋮ A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares ⋮ Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization ⋮ Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization ⋮ Simulated annealing with asymptotic convergence for nonlinear constrained optimization ⋮ On using equality-constraint algorithms for inequality constrained problems ⋮ A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness ⋮ A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints ⋮ Feasible directions algorithms for optimization problems with equality and inequality constraints ⋮ A numerical study of augmented penalty function algorithms for terminally constrained optimal control problems ⋮ On the combination of the multiplier method of Hestenes and Powell with Newton's method ⋮ An exact penalty function for nonlinear programming with inequalities ⋮ Multiplier methods: A survey ⋮ An economical method of calculating Lagrange multiplier estimates for nonlinear programming problems when many of the constraints are bounds on the variables ⋮ A multiplier method with automatic limitation of penalty growth ⋮ On the global stabilization of locally convergent algorithms ⋮ On the finite element solution of frictionless contact problems using an exact penalty approach ⋮ Diagonalized multiplier methods and quasi-Newton methods for constrained optimization ⋮ Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian ⋮ A second-order method for the general nonlinear programming problem ⋮ A geometric method in nonlinear programming ⋮ Properties of updating methods for the multipliers in augmented Lagrangians ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ An exact \(l_1\) penalty function method for multi-dimensional first-order PDE constrained control optimization problem ⋮ Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints ⋮ Exact penalty functions method for mathematical programming problems involving invex functions ⋮ A new approach to constrained function optimization ⋮ The multiplier method of Hestenes and Powell applied to convex programming ⋮ Nonlinear programming using minimax techniques ⋮ Iterative determination of parameters for an exact penalty function ⋮ Local analysis of a new multipliers method ⋮ Automatic differentiation of algorithms ⋮ A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set ⋮ Geometry of optimality conditions and constraint qualifications
This page was built for publication:
