Pages that link to "Item:Q4767127"
From MaRDI portal
The following pages link to A dual approach to solving nonlinear programming problems by unconstrained optimization (Q4767127):
Displayed 43 items.
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
- A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming (Q3405602) (← links)
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM (Q3526524) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- (Q3658964) (← links)
- (Q3718492) (← links)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884) (← links)
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications (Q3851986) (← links)
- Extremal problems with an infinite number of inequality constraints (Q3873960) (← links)
- Global saddle-point duality for quasi-concave programs (Q3911673) (← links)
- (Q3915546) (← links)
- A method of centers algorithm for certain minimax problems (Q3929560) (← links)
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function (Q3934150) (← links)
- (Q4009549) (← links)
- Multiplier method and optimal control problems with terminal state constraints (Q4051203) (← links)
- Feasible directions algorithms for optimization problems with equality and inequality constraints (Q4121704) (← links)
- (Q4124710) (← links)
- The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming (Q4133427) (← links)
- Multiplier functions and duality for non-linear programmes having a set constraint (Q4152043) (← links)
- Nonlinear leastpth optimization and nonlinear programming (Q4152045) (← links)
- Perturbation des méthodes d'optimisation. Applications (Q4158829) (← links)
- Algorithms for nonlinear constraints that use lagrangian functions (Q4162980) (← links)
- A characterization of the optimal set of linear programs based on the augmented lagrangian (Q4264505) (← links)
- Mechanical design problems with unilateral contact (Q4393392) (← links)
- The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces (Q4629342) (← links)
- On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces (Q4641763) (← links)
- Funciones penalidad y lagrangianos aumentados (Q4749606) (← links)
- (Q4872371) (← links)
- Safeguarded Augmented Lagrangian Methods in Banach Spaces (Q5051777) (← links)
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints (Q5114401) (← links)
- Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems (Q5162655) (← links)
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming (Q5169465) (← links)
- Augmented Lagrangian methods for variational inequality problems (Q5189878) (← links)
- The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming (Q5221274) (← links)
- The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity (Q5265452) (← links)
- The rate of convergence of proximal method of multipliers for nonlinear programming (Q5858993) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- Study of variational inequality and equality formulations for elastostatic frictional contact problems (Q5933951) (← links)
- Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches (Q5959911) (← links)
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming (Q6038648) (← links)
- Study on convex optimization with least constraint violation under a general measure (Q6092939) (← links)
- The augmented Lagrangian method can approximately solve convex optimization with least constraint violation (Q6102759) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)