Descent algorithm for a class of convex nondifferentiable functions

DOI10.1007/BF00940519MaRDI QIDQ1321148zbMATH OpenFDO

Authors V. Pereyra

Publication date 27 April 1994

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

nondifferentiable programmingsubhessian\(\varepsilon\)-descent basic method\(\varepsilon\)-global convergenceconvex minmax problemconvex nonsmooth optimizationunconstrained convex problem

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Nonsmooth analysis (49J52) Existence of solutions for minimax problems (49J35)

Recommendations

• A descent algorithm for nonsmooth convex optimization
• Publication:3479818
• Quadratic Approximations in Convex Nondifferentiable Optimization
• scientific article; zbMATH DE number 67982

Cites work

• scientific article; zbMATH DE number 3930735 (Why is no real title available?)
• scientific article; zbMATH DE number 3718477 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A descent algorithm for nonsmooth convex optimization
• A model algorithm for composite nondifferentiable optimization problems
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• A subgradient algorithm for certain minimax and minisum problems
• An Algorithm for Constrained Optimization with Semismooth Functions
• Combined lp and quasi-Newton methods for minimax optimization
• Convex Analysis
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• Generalized Gradients and Applications
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
• Local properties of algorithms for minimizing nonsmooth composite functions
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• Numerical methods for nondifferentiable convex optimization
• On the exactness of a class of nondifferentiable penalty functions
• Variable metric methods for minimizing a class of nondifferentiable functions
• ε-Optimal solutions in nondifferentiable convex programming and some related questions

Cited in

(4)

• On a feasible descent algorithm for solving min-max problems
• scientific article; zbMATH DE number 3912124 (Why is no real title available?)
• On Steepest Descent Algorithms for Discrete Convex Functions
• A descent algorithm for nonsmooth convex optimization

This page was built for publication: Descent algorithm for a class of convex nondifferentiable functions

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