Piecewise linear paths to minimize convex functions may not be monotonic

DOI10.1007/BF01588230zbMath0408.90067OpenAlexW2016728042MaRDI QIDQ4196252

Michael J. Todd

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

convex functionsnonlinear programmingunconstrained minimizationfixed point algorithmsmonotonic paths

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Fixed-point and coincidence theorems (topological aspects) (54H25)

Cites Work

• Unnamed Item
• The computation of fixed points and applications
• The Solution of Systems of Piecewise Linear Equations
• On Paths Generated by Fixed Point Algorithms
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• Efficient Acceleration Techniques for Fixed Point Algorithms
• A Theorem on Homotopy Paths
• Improving the convergence of fixed-point algorithms
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: Piecewise linear paths to minimize convex functions may not be monotonic