An approximate decomposition algorithm for convex minimization

DOI10.1016/J.CAM.2010.01.003zbMATH Open1190.65098OpenAlexW2003297596MaRDI QIDQ966076FDOQ966076

Authors: Yuan Lu, Li-Ping Pang, X.-J. Liang, Zun-Quan Xia 

Publication date: 27 April 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.01.003

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

zbMATH Keywords

proximal bundle methodnonsmooth convex optimizationsmooth pathapproximate U-LagrangianVU-decompositionVU-theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• Convergence of some algorithms for convex minimization
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• A proximal bundle method based on approximate subgradients
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Identifiable Surfaces in Constrained Optimization
• The 𝒰-Lagrangian of a convex function
• Active Sets, Nonsmoothness, and Sensitivity
• Title not available (Why is that?)
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• Title not available (Why is that?)
• An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition

Cited In (24)

• Approximate decomposition algorithm for solving the bilevel programming with the minimum risk
• Approximate methods for convex minimization problems with series-parallel structure
• Subdifferential enlargements and continuity properties of the \(\mathcal{VU}\)-decomposition in convex optimization
• Identifying structure of nonsmooth convex functions by the bundle technique
• A decomposition algorithm for convex nondifferentiable minimization with errors
• A modified \(\mathcal{UV}\)-decomposition algorithm
• Decomposition algorithm for convex differentiable minimization
• Coincidence point theorems on metric spaces via simulation functions
• A filled function method for minimizing control variation in constrained discrete-time optimal control problems
• Fast inexact decomposition algorithms for large-scale separable convex optimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• Title not available (Why is that?)
• A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
• Exact and approximation algorithms for computing optimal fat decompositions
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
• An approximate alternating linearization decomposition method
• A superlinear space decomposition algorithm for constrained nonsmooth convex program
• The \(\mathcal{VU}\)-decomposition to the proper convex function
• Numerical analysis of \(\mathcal{VU}\)-decomposition, \(\mathcal{U}\)-gradient, and \(\mathcal{U}\)-Hessian approximations
• The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
• A regularized decomposition method for minimizing a sum of polyhedral functions
• A decomposition based algorithm for maximal contractions
• A \(\mathcal{VU}\)-algorithm for convex minimization

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)