A accelerated hybrid descent algorithm for convex minimization

MaRDI QIDQ3132466zbMATH OpenFDO

Authors Haiwen Xu, Liming Sun

Publication date 29 January 2018

zbMATH Keywords

convex minimizationforward accelerated contraction algorithmhybrid descent algorithmproximal point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 6129040
• A hybrid descent method for solving a convex constrained optimization problem with applications
• Hybrid modification of accelerated double direction method
• Hybridization of accelerated gradient descent method
• Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

Cited in

(4)

• Hybrid modification of accelerated double direction method
• scientific article; zbMATH DE number 6129040 (Why is no real title available?)
• Convex Synthesis of Accelerated Gradient Algorithms
• Accelerated Schemes for the $L_1/L_2$ Minimization

This page was built for publication: A accelerated hybrid descent algorithm for convex minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132466)