A numerical method of nondifferentiable convex optimization with constraints

DOI10.1007/BF01098344MaRDI QIDQ684625zbMATH OpenFDO

Authors Yu. V. Trius

Publication date 9 December 1993

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convex nondifferentiable functionalreal Hilbert space

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Recommendations

• An approximate method for solving the convex programming problem
• On an algorithm in nondifferential convex optimization
• Numerical methods for nondifferentiable convex optimization
• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• Constrained gradient method for nonsmooth optimization problems

Cited in

(10)

• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• scientific article; zbMATH DE number 4104724 (Why is no real title available?)
• scientific article; zbMATH DE number 590870 (Why is no real title available?)
• Derivation of high order efficient numerical methods fory’=f(x, y) – A constrained optimization problem
• Numerical methods for nondifferentiable convex optimization
• Minimization of A Nondifferentiable Convex Function Defined not Everywhere
• Une méthode numérique pour les problèmes variationnels sous contrainte de convexité
• On an algorithm in nondifferential convex optimization
• scientific article; zbMATH DE number 5064899 (Why is no real title available?)
• An approximate method for solving the convex programming problem

This page was built for publication: A numerical method of nondifferentiable convex optimization with constraints

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