Unification of basic and composite nondifferentiable optimization

DOI10.1007/BF01585939zbMath0856.90087OpenAlexW2046263494MaRDI QIDQ1924063

Jean-Pierre Dussault, Youssou Gningue

Publication date: 3 February 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585939

zbMATH Keywords

second-order convergencesubdifferentialnondifferentiable optimizationpolyhedral approximationcomposite functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local properties of algorithms for minimizing nonsmooth composite functions
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• Descent methods for composite nondifferentiable optimization problems
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• An Efficient Method to Solve the Minimax Problem Directly
• Some examples of cycling in variable metric methods for constrained minimization
• A computational comparison of some non-linear programs

This page was built for publication: Unification of basic and composite nondifferentiable optimization