A log-sigmoid regularization method for saddle point seeking

MaRDI QIDQ3421933zbMATH OpenFDO

Authors Abdelouahed Hamdi, Eman H. Al-Shemas

Publication date 8 February 2007

zbMATH Keywords

large scale optimizationconvex programmingGauss-Seidel methodseparable programmingaugmented Lagrangian functionslog-sigmoid smoothing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Recommendations

• A re-scaled twin augmented Lagrangian algorithm for saddle point seeking
• Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones
• Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems
• Log-sigmoid multipliers method in constrained optimization
• Smooth methods of multipliers for complementarity problems

Cited in

(1)

• A re-scaled twin augmented Lagrangian algorithm for saddle point seeking

This page was built for publication: A log-sigmoid regularization method for saddle point seeking

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