A feasible direction algorithm for convex optimization: Global convergence rates

DOI10.1007/BF00934585MaRDI QIDQ1252156zbMATH OpenFDO

Authors J. C. Allwright

Publication date 1980

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

zbMATH Keywords

Convex OptimizationFeasible Direction AlgorithmGlobal Convergence Rates

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Rate of convergence, degree of approximation (41A25)

Cites work

• scientific article; zbMATH DE number 3481374 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• On the Goldstein-Levitin-Polyak gradient projection method
• On the Pironneau-Polak method of centers
• On the rate of convergence of some feasible direction algorithms
• Rate of Convergence of a Class of Methods of Feasible Directions
• Rates of convergence for a method of centers algorithm

Cited in

(5)

• Optimal control of systems described by delay differential equations
• Convergence analysis of norm-relaxed method of feasible directions
• A base reduction method for convex programming
• Convergent stepsizes for constrained optimization algorithms
• A class of superlinearly convergent projection algorithms with relaxed stepsizes

This page was built for publication: A feasible direction algorithm for convex optimization: Global convergence rates

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