The modified subgradient method for equality constrained nonconvex optimization problems

MaRDI QIDQ5702605zbMATH OpenFDO

Authors Nergiz A. Ismayilova, Rafail N. Gasimov

Publication date 2 November 2005

zbMATH Keywords

algorithmaugmented Lagrangiandual functionduality with zero gapequality constraintsnonconvex minimizationstopping criteriasubgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Recommendations

• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• A primal dual modified subgradient algorithm with sharp Lagrangian
• The modified subgradient algorithm based on feasible values
• scientific article; zbMATH DE number 4041643

Cited in

(9)

• An improved subgradient method for constrained nondifferentiable optimization
• An inexact modified subgradient algorithm for nonconvex optimization
• A primal dual modified subgradient algorithm with sharp Lagrangian
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• A Lagrangian dual spectral projected gradient method for nonconvex constrained optimization
• A sharp augmented Lagrangian-based method in constrained non-convex optimization
• The modified subgradient algorithm based on feasible values
• Convergence properties of the modified subgradient method of camerini et al
• A modified subgradient algorithm for Lagrangean relaxation

This page was built for publication: The modified subgradient method for equality constrained nonconvex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5702605)