scientific article; zbMATH DE number 429229

MaRDI QIDQ3137808zbMATH OpenFDO

Authors Youssef Aly Mohamed Baghdadi

Publication date 20 December 1993

zbMATH Keywords

conditional \(\varepsilon\)-subgradientLipschitzian functionsnondifferentiable optimization

Mathematics Subject Classification ID

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

Recommendations

• Method of conditional ?-subgradient for solving convex programming problems
• Two-direction subgradient method for non-differentiable optimization problems
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
• ?-Subgradient mapping and the problem of convex optimization
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals

Cited in

(17)

• An optimal method of constructing an -subgradient
• On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
• Lipschitz continuity of the -subdifferential and nonmonotonic methods with averaging of -subgradients for nonsmooth optimization
• Epsilon-proximal point algorithms for nondifferentiable convex optimization problems and applications
• scientific article; zbMATH DE number 3887445 (Why is no real title available?)
• ?-Subgradient mapping and the problem of convex optimization
• scientific article; zbMATH DE number 4080781 (Why is no real title available?)
• scientific article; zbMATH DE number 4104724 (Why is no real title available?)
• Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
• scientific article; zbMATH DE number 67982 (Why is no real title available?)
• scientific article; zbMATH DE number 195045 (Why is no real title available?)
• Method of conditional ?-subgradient for solving convex programming problems
• scientific article; zbMATH DE number 3894844 (Why is no real title available?)
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
• Two-direction subgradient method for non-differentiable optimization problems
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
• Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs

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 Q3137808)