The following pages link to (Q4099846):
Displaying 45 items.
- A primal-dual augmented Lagrangian (Q434173) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Exact penalties for variational inequalities with applications to nonlinear complementarity problems (Q616794) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints (Q750303) (← links)
- Optimizing preventive maintenance models (Q853881) (← links)
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities (Q868635) (← links)
- Penalty function methods and a duality gap for invex optimization problems (Q923993) (← links)
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization (Q946337) (← links)
- Exact penalty functions method for mathematical programming problems involving invex functions (Q1027576) (← links)
- New results on a class of exact augmented Lagrangians (Q1093533) (← links)
- Least squares with non-linear equality constraints. Application to closing of balances (Q1144365) (← links)
- A globally convergent, implementable multiplier method with automatic penalty limitation (Q1145623) (← links)
- A new augmented Lagrangian function for inequality constraints in nonlinear programming problems (Q1148810) (← links)
- Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- An economical method of calculating Lagrange multiplier estimates for nonlinear programming problems when many of the constraints are bounds on the variables (Q1226038) (← links)
- On the global stabilization of locally convergent algorithms (Q1229433) (← links)
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization (Q1230357) (← links)
- A second-order method for the general nonlinear programming problem (Q1245156) (← links)
- A geometric method in nonlinear programming (Q1253613) (← links)
- Properties of updating methods for the multipliers in augmented Lagrangians (Q1256396) (← links)
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
- A trust region algorithm for nonsmooth optimization (Q1341571) (← links)
- Automatic differentiation of algorithms (Q1593824) (← links)
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness (Q1752649) (← links)
- Iterative determination of parameters for an exact penalty function (Q1843377) (← links)
- Local analysis of a new multipliers method (Q1848393) (← links)
- Geometric approach to Fletcher's ideal penalty function (Q1893322) (← links)
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- On the finite element solution of frictionless contact problems using an exact penalty approach (Q2021156) (← links)
- A numerical study of augmented penalty function algorithms for terminally constrained optimal control problems (Q2264322) (← links)
- On the combination of the multiplier method of Hestenes and Powell with Newton's method (Q2264406) (← links)
- An exact \(l_1\) penalty function method for multi-dimensional first-order PDE constrained control optimization problem (Q2301563) (← links)
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
- A new approach to constrained function optimization (Q2557913) (← links)
- The multiplier method of Hestenes and Powell applied to convex programming (Q2558160) (← links)
- Nonlinear programming using minimax techniques (Q2560772) (← links)
- An analysis of reduced Hessian methods for constrained optimization (Q2640451) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- A multiplier method with automatic limitation of penalty growth (Q3050151) (← links)
- Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization (Q3300857) (← links)
- Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization (Q3300858) (← links)
- On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems (Q6059887) (← links)
