A new method for nonsmooth convex optimization

DOI10.1155/S1025583498000101MaRDI QIDQ1386698zbMATH OpenFDO

Authors D. Massart, Zengxin Wei, Liqun Qi, John R. Birge

Publication date 12 July 1998

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119651

zbMATH Keywords

global and superlinear convergenceproper closed convex functionproximal minimization

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Linear programming (90C05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 7165389
• On a new smoothing technique for non-smooth, non-convex optimization
• A method for nonsmooth optimization problems
• An approach to solving convex programs with nonsmooth objectives
• scientific article; zbMATH DE number 5653878
• scientific article; zbMATH DE number 2164718
• A continuous method for solving nonconvex optimization problem
• scientific article; zbMATH DE number 440752
• scientific article; zbMATH DE number 1822478
• scientific article; zbMATH DE number 7404502

Cited in

(26)

• A proximal iterative approach to a non-convex optimization problem
• Convergence analysis of some methods for minimizing a nonsmooth convex function
• A general approach to convergence properties of some methods for nonsmooth convex optimization
• Coupling the proximal point algorithm with approximation methods
• A multipoint method of minimization of a convex function
• Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
• A novel method for non-probabilistic convex modelling based on data from practical engineering
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A generic result in vector optimization
• The optimization for the inequalities of power means
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• Fast proximal algorithms for nonsmooth convex optimization
• scientific article; zbMATH DE number 5653878 (Why is no real title available?)
• A feasible directions method for nonsmooth convex optimization
• New Proximal Point Algorithms for Convex Minimization
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
• Convergence analysis of a proximal newton method¹
• scientific article; zbMATH DE number 7165389 (Why is no real title available?)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
• Some new step-size rules for optimization problems
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• A new heuristic approach for non-convex optimization problems

This page was built for publication: A new method for nonsmooth convex optimization

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