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

DOI10.1016/J.NA.2007.11.042zbMATH Open1165.90587OpenAlexW1990362779MaRDI QIDQ960238FDOQ960238

Authors: Abdelouahed Hamdi, Huda Al-Saud 

Publication date: 16 December 2008

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2007.11.042

Recommendations

• A log-sigmoid regularization method for saddle point seeking
• Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
• scientific article; zbMATH DE number 1488004
• Proximal point nonlinear rescaling method for convex optimization
• An augmented Lagrangian affine scaling method for nonlinear programming

zbMATH Keywords

decompositionmultipliers method

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Parallel alternating direction multiplier decomposition of convex programs
• Nonlinear rescaling vs. smoothing technique in convex optimization
• Title not available (Why is that?)
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
• Log-sigmoid multipliers method in constrained optimization
• A primal-dual algorithm for monotropic programming and its application to network optimization

Cited In (2)

• A log-sigmoid regularization method for saddle point seeking
• Decomposition methods based on augmented Lagrangians: a survey

This page was built for publication: A re-scaled twin augmented Lagrangian algorithm for saddle point seeking

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