scientific article; zbMATH DE number 6129040

MaRDI QIDQ4900519zbMATH OpenFDO

Authors Haiwen Xu

Publication date 24 January 2013

zbMATH Keywords

approximate proximal point methodconvex minimizationhybrid descent methodproximal point method

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

• A accelerated hybrid descent algorithm for convex minimization
• A hybrid descent method for solving a convex constrained optimization problem with applications
• A hybrid steepest descent method for constrained convex optimization
• A descent algorithm for nonsmooth convex optimization
• A Descent Algorithm for Minimizing Polyhedral Convex Functions
• Publication:3479818
• A hybrid conjugate gradient method with sufficient descent property
• Two descent hybrid conjugate gradient methods for optimization
• A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings
• A hybrid descent method for global optimization

Cited in

(4)

• A hybrid steepest descent method for constrained convex optimization
• Hybrid parametric minimum principle
• Two descent hybrid conjugate gradient methods for optimization
• A accelerated hybrid descent algorithm for convex minimization

This page was built for publication:

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