Partial Proximal Minimization Algorithms for Convex Pprogramming
From MaRDI portal
Publication:4308555
DOI10.1137/0804031zbMath0819.90069OpenAlexW2108252660MaRDI QIDQ4308555
Dimitri P. Bertsekas, Paul Tseng
Publication date: 8 August 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0804031
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)
Related Items
Error bounds in mathematical programming, On the convergence of a modified version of SVMlightalgorithm, The proximal Chebychev center cutting plane algorithm for convex additive functions, Equilibrium programming using proximal-like algorithms, Scenario decomposition of risk-averse multistage stochastic programming problems, Some convergence results on the regularized alternating least-squares method for tensor decomposition, Global optimization for non-convex programs via convex proximal point method, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, A partial proximal point algorithm for nuclear norm regularized matrix least squares problems, A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints, A convergent decomposition algorithm for support vector machines, Non-Convex feasibility problems and proximal point methods, Divide to conquer: decomposition methods for energy optimization, Convergence analysis of some methods for minimizing a nonsmooth convex function, Convergence analysis of a proximal newton method1, Partial proximal point method for nonmonotone equilibrium problems, Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
