Applications of the method of partial inverses to convex programming: Decomposition

DOI10.1007/BF01586091zbMath0565.90058MaRDI QIDQ3680618

Jonathan E. Spingarn

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear convergenceproximal point algorithmseparable convex programmingmonotone multifunctionprimal-dual decomposition method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Methods of successive quadratic programming type (90C55)

Related Items

Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators, A proximal-based deomposition method for compositions method for convex minimization problems, Existence and proximal point algorithms for nonlinear monotone complementarity problems^*, Conic optimization via operator splitting and homogeneous self-dual embedding, Unnamed Item, Approximations in proximal bundle methods and decomposition of convex programs, Decomposition Methods for Sparse Matrix Nearness Problems, Coupling proximal methods and variational convergence, Decomposition Methods Based on Augmented Lagrangians: A Survey, Monotone operator theory in convex optimization, Conditioning and regularization of nonsymmetric operators, Decomposition methods in stochastic programming, Algorithms for the solution of stochastic dynamic minimax problems, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, A quasi-second-order proximal bundle algorithm, Multi-step-prox-regularization method for solving convex variation problems, Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions, A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems, Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Convexification and decomposition of separable nonconvex optimization problems, Generalizations of the proximal method of multipliers in convex optimization, A survey on operator splitting and decomposition of convex programs, Convergence rate of a proximal multiplier algorithm for separable convex minimization, Modified Lagrangian methods for separable optimization problems, A class of Dantzig-Wolfe type decomposition methods for variational inequality problems, Duality for constrained multifacility location problems with mixed norms and applications, Parameter Selection and Preconditioning for a Graph Form Solver, A primal-dual method of partial inverses for composite inclusions, Convergence of the augmented decomposition algorithm, Forward-partial inverse-forward splitting for solving monotone inclusions, A general system for heuristic minimization of convex functions over non-convex sets, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Decomposition methods for a spatial model for long-term energy pricing problem, Application of the alternating direction method of multipliers to separable convex programming problems, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, A primal-dual proximal point algorithm for constrained convex programs, Two-level primal-dual proximal decomposition technique to solve large scale optimization problems, A viscosity splitting algorithm for solving inclusion and equilibrium problems, Solving monotone inclusions via compositions of nonexpansive averaged operators, Unnamed Item, The distance between convex sets with Minkowski sum structure: application to collision detection, Fast inexact decomposition algorithms for large-scale separable convex optimization, A proximal multiplier method for separable convex minimization, Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity, Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods, On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting, Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications, Progressive regularization of variational inequalities and decomposition algorithms, Prox-regularization and solution of ill-posed elliptic variational inequalities, An inexact method of partial inverses and a parallel bundle method, The cluster set of a nonexpansive mapping, A variable-penalty alternating directions method for convex optimization, Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions, On an iterative method for finding a zero to the sum of two maximal monotone operators, A primal-dual projection method for solving systems of linear inequalities, Two general methods for computing saddle points with applications for decomposing convex programming problems, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Parallel alternating direction multiplier decomposition of convex programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• Auxiliary problem principle and decomposition of optimization problems
• A primal-dual projection method for solving systems of linear inequalities
• Monotone (nonlinear) operators in Hilbert space
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Decomposition in large system optimization using the method of multipliers
• Convexification procedures and decomposition methods for nonconvex optimization problems
• A projection method for least-squares solutions to overdetermined systems of linear inequalities
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Multiplier and gradient methods
• On the maximal monotonicity of subdifferential mappings
• The multiplier method of Hestenes and Powell applied to convex programming
• Decomposition Principle for Linear Programs
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Fixed and Variable Constraints in Sensitivity Analysis
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Monotone Operators and the Proximal Point Algorithm
• Sensitivity analysis for nonlinear programming using penalty methods
• Optimization by decomposition and coordination: A unified approach
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex Analysis
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development