Decomposition for structured convex programs with smooth multiplier methods
From MaRDI portal
Publication:2572336
DOI10.1016/j.amc.2004.10.079zbMath1091.65056OpenAlexW2013789575MaRDI QIDQ2572336
Publication date: 16 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.079
convergencecomparison of methodsnumerical examplesdecomposition methodsNewton type methodsconvex programsaugmented Lagrangian/multiplier methodsexponential multiplier methodsproximallike methodsquadratic alternating direction methods
Related Items
Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Modified Lagrangian methods for separable optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
- Enlarging the region of convergence of Newton's method for constrained optimization
- Modified barrier functions (theory and methods)
- Complete decomposition algorithm for nonconvex separable optimization problems and applications
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- Parallel alternating direction multiplier decomposition of convex programs
- A proximal-based deomposition method for compositions method for convex minimization problems
- Nonlinear rescaling and proximal-like methods in convex optimization
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Computational experience with penalty-barrier methods for nonlinear programming
- Separable diagonalized multiplier method for decomposition nonlinear programs
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Convergence of Proximal-Like Algorithms
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
