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 50 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- A splitting algorithm for image segmentation on manifolds represented by the grid based particle method (Q364679) (← links)
- On the reduction of the normality conditions in equality-constrained optimization problems in mechanics (Q399245) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Existence of augmented Lagrange multipliers for cone constrained optimization problems (Q742117) (← links)
- A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
- Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems (Q885308) (← links)
- Split Bregman method for large scale fused Lasso (Q901530) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians (Q975359) (← links)
- An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones (Q1014035) (← links)
- Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones (Q1023315) (← links)
- A constrained min-max algorithm for rival models (Q1104224) (← links)
- A superlinearly convergent constrained min-max algorithm for rival models of the same system (Q1119151) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- A globally convergent, implementable multiplier method with automatic penalty limitation (Q1145623) (← links)
- Second-order optimality conditions for a class of nonlinear programming problems (Q1146116) (← links)
- A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation (Q1235959) (← links)
- A second-order method for the general nonlinear programming problem (Q1245156) (← links)
- Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
- The value function of a mixed integer program. II (Q1258688) (← links)
- Implied constraints and a unified theory of duality in linear and nonlinear programming (Q1319546) (← links)
- Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
- Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- Augmented Lagrangian theory, duality and decomposition methods for variational inequality problems (Q1411499) (← links)
- Two-dimensional compact variational mode decomposition (Q1702599) (← links)
- On the twice differentiable cubic augmented Lagrangian (Q1908654) (← links)
- A genetic algorithm based augmented Lagrangian method for constrained optimization (Q1935579) (← links)
- On the combination of the multiplier method of Hestenes and Powell with Newton's method (Q2264406) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems (Q2489329) (← links)
- A nonlinear Lagrangian for constrained optimization problems (Q2511046) (← links)
- The multiplier method of Hestenes and Powell applied to convex programming (Q2558160) (← links)
- Lagrange optimality system for a class of nonsmooth convex optimization (Q2810115) (← links)
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems (Q2905344) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- The Legendre Transformation in Modern Optimization (Q2957720) (← links)