A proximal-based deomposition method for compositions method for convex minimization problems
From MaRDI portal
Publication:1330895
DOI10.1007/BF01582566zbMath0823.90097MaRDI QIDQ1330895
Publication date: 10 August 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
65Y05: Parallel numerical computation
Related Items
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, Convergence analysis of a proximal newton method1, An improved contraction method for structured monotone variational inequalities, A decomposition method for convex minimization problems and its application., A descent method for structured monotone variational inequalities, A new accuracy criterion for approximate proximal point algorithms, The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets, An improved proximal alternating direction method for monotone variational inequalities with separable structure, Hybrid approximate proximal method with auxiliary variational inequality for vector optimization, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, Alternating direction augmented Lagrangian methods for semidefinite programming, Fast minimization methods for solving constrained total-variation superresolution image reconstruction, A unified primal-dual algorithm framework based on Bregman iteration, Alternating direction method for bi-quadratic programming, A class of linearized proximal alternating direction methods, The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities, Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities, Interior-point Lagrangian decomposition method for separable convex optimization, Inexact proximal point method for general variational inequalities, The prediction-correction approach to nonlinear complementarity problems, An improved proximal-based decomposition method for structured monotone variational inequalities, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, Proximal point algorithms for general variational inequalities, Convergence analysis of some methods for minimizing a nonsmooth convex function, Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators, A variable-penalty alternating directions method for convex optimization, New decomposition methods for solving variational inequality problems., Nonlinear proximal decomposition method for convex programming, Approximate proximal methods in vector optimization, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, An inexact proximal-type algorithm in Banach spaces, Comparison of two proximal point algorithms for monotone variational inequalities, Modified approximate proximal point algorithms for finding roots of maximal monotone operators, Decomposition for structured convex programs with smooth multiplier methods, Globally convergent block-coordinate techniques for unconstrained optimization
Cites Work
- Enlarging the region of convergence of Newton's method for constrained optimization
- On the convergence of Han's method for convex programming with quadratic objective
- 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
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- Applications of the method of partial inverses to convex programming: Decomposition
- A Parallel Algorithm for a Class of Convex Programs
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- On-line hierarchical control for steady-state systems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
