Pages that link to "Item:Q4308555"

The following pages link to Partial Proximal Minimization Algorithms for Convex Pprogramming (Q4308555):

Displaying 17 items.

• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
• A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints (Q496623) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740) (← links)
• Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
• Scenario decomposition of risk-averse multistage stochastic programming problems (Q1931651) (← links)
• Some convergence results on the regularized alternating least-squares method for tensor decomposition (Q1931768) (← links)
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647) (← links)
• A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
• Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
• Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
• Convergence analysis of a proximal newton method¹ (Q4714551) (← links)
• On the convergence of a modified version of SVM<i>^light</i>algorithm (Q5317752) (← links)
• Partial proximal point method for nonmonotone equilibrium problems (Q5475280) (← links)