A decomposition method for convex minimization problems and its application.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3976778
- Application of the alternating direction method of multipliers to separable convex programming problems
- Applications of the method of partial inverses to convex programming: Decomposition
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A proximal-based deomposition method for compositions method for convex minimization problems
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Parallel Algorithm for a Class of Convex Programs
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence of some algorithms for convex minimization
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- On the convergence of Han's method for convex programming with quadratic objective
Cited in
(19)- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
- Bundle-based decomposition: Conditions for convergence
- Decomposition algorithm for convex differentiable minimization
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Decomposition methods for differentiable optimization problems over Cartesian product sets
- Nonlinear proximal decomposition method for convex programming
- A parallel descent algorithm for convex programming
- Methods of descent over groups of variables for a class of constrained minimization problems
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Adaptive descent splitting method for decomposable optimization problems
- scientific article; zbMATH DE number 6613055 (Why is no real title available?)
- scientific article; zbMATH DE number 3885226 (Why is no real title available?)
- Decomposition-aggregation method for convex programming problems
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- Sequential threshold control in descent splitting methods for decomposable optimization problems
- A regularized decomposition method for minimizing a sum of polyhedral functions
- scientific article; zbMATH DE number 3976778 (Why is no real title available?)
- An approximate decomposition algorithm for convex minimization
This page was built for publication: A decomposition method for convex minimization problems and its application.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931895)
