Descent methods for convex optimization problems in Banach spaces

DOI10.1155/IJMMS.2005.2347MaRDI QIDQ2368348zbMATH OpenOpenAlexFDO

Authors Mohamed S. S. Ali

Publication date 19 April 2006

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Inexact descent methods for convex minimization problems in Banach spaces
• Descent methods for equilibrium problems in a Banach space
• Inexact descent methods with convex objective functions in Banach spaces
• Descent methods for convex essentially smooth minimization
• Descent methods for monotone equilibrium problems in Banach spaces
• scientific article; zbMATH DE number 3972657
• Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces
• Convex optimization on Banach spaces
• Descent methods in the presence of computational errors in Banach spaces
• Descent methods with computational errors in Banach spaces

Cited in

(7)

• scientific article; zbMATH DE number 2208669 (Why is no real title available?)
• Descent for semiorthogonal decompositions
• Convex optimization on Banach spaces
• On convergence of descent methods for variational inequalities in a Hilbert space
• Nonsmooth nonconvex global optimization in a Banach space with a basis
• The set of divergent descent methods in a Banach space is \(\sigma\)-porous
• Partial linearization method for convex optimization problems in Banach spaces

This page was built for publication: Descent methods for convex optimization problems in Banach spaces

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