An approximate decomposition algorithm for convex minimization
From MaRDI portal
Publication:966076
Recommendations
- Decomposition algorithm for convex differentiable minimization
- A decomposition method for convex minimization problems and its application.
- A Decomposition Method and Its Application to Convex Programming
- A decomposition algorithm for convex nondifferentiable minimization with errors
- scientific article; zbMATH DE number 1190656
- An algorithm for approximate multiparametric convex programming
- An approximate method for solving the convex programming problem
- scientific article; zbMATH DE number 4045481
- A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1873048 (Why is no real title available?)
- scientific article; zbMATH DE number 1424528 (Why is no real title available?)
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A proximal bundle method based on approximate subgradients
- Active Sets, Nonsmoothness, and Sensitivity
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition
- Convergence of some algorithms for convex minimization
- Identifiable Surfaces in Constrained Optimization
- Monotone Operators and the Proximal Point Algorithm
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- The 𝒰-Lagrangian of a convex function
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(24)- Decomposition algorithm for convex differentiable minimization
- Approximate decomposition algorithm for solving the bilevel programming with the minimum risk
- Approximate methods for convex minimization problems with series-parallel structure
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- The \(\mathcal{VU}\)-decomposition to the proper convex function
- scientific article; zbMATH DE number 6381654 (Why is no real title available?)
- Subdifferential enlargements and continuity properties of the \(\mathcal{VU}\)-decomposition in convex optimization
- A decomposition algorithm for convex nondifferentiable minimization with errors
- A modified \(\mathcal{UV}\)-decomposition algorithm
- A superlinear space decomposition algorithm for constrained nonsmooth convex program
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Coincidence point theorems on metric spaces via simulation functions
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- A regularized decomposition method for minimizing a sum of polyhedral functions
- A decomposition based algorithm for maximal contractions
- Identifying structure of nonsmooth convex functions by the bundle technique
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- Numerical analysis of \(\mathcal{VU}\)-decomposition, \(\mathcal{U}\)-gradient, and \(\mathcal{U}\)-Hessian approximations
- An approximate alternating linearization decomposition method
- A filled function method for minimizing control variation in constrained discrete-time optimal control problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Exact and approximation algorithms for computing optimal fat decompositions
This page was built for publication: An approximate decomposition algorithm for convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966076)
