Two general methods for computing saddle points with applications for decomposing convex programming problems

DOI10.1007/BF01442200zbMATH Open0584.65035OpenAlexW1991689826MaRDI QIDQ1069674FDOQ1069674

Authors: A. Auslender 

Publication date: 1985

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01442200

Recommendations

• A generalization of the saddle point method with applications
• A new fast method to compute saddle-points in constrained optimization and applications
• On the generalized SOR-like methods for saddle point problems
• The saddle point method and its applications
• On saddle points and optima for non-smooth and non-convex programs
• A sequential two-stage method for solving generalized saddle point problems
• scientific article
• A two-level subgradient method for finding saddle points of convex- concave functions
• Some Observations on Generalized Saddle-Point Problems
• An interior-point method for a class of saddle-point problems

zbMATH Keywords

decomposition algorithmssaddle pointscolumn methodseparable convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Applications of the method of partial inverses to convex programming: Decomposition
• Numerical methods for finding saddle points
• Coincidence properties of birth and death processes

Cited In (8)

• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
• Title not available (Why is that?)
• Title not available (Why is that?)
• Large-scale convex optimization via saddle point computation
• Penalization in non-classical convex programming via variational convergence
• A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
• On the convergence of the proximal algorithm for saddle-point problems
• A General Primal-Dual Envelope Method for Convex Programming Problems

This page was built for publication: Two general methods for computing saddle points with applications for decomposing convex programming problems

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