论文信息 - Piecewise linear paths to minimize convex functions may not be monotonic - 字舞流文

Piecewise linear paths to minimize convex functions may not be monotonic

The exact homotopy path when seeking the minimum of a convex function is monotonic in the homotopy parameter. This monotonicity is not inherited by the piecewise linear approximations to such paths produced by fixed-point algorithms.

Michael J. Todd

[1] M. Todd. The Computation of Fixed Points and Applications , 1976 .

[2] M. Todd. Improving the convergence of fixed-point algorithms , 1978 .

[3] R. Saigal,et al. On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting , 1977, Math. Oper. Res..

[4] Romesh Saigal,et al. On Paths Generated by Fixed Point Algorithms , 1976, Math. Oper. Res..

[5] Herbert E. Scarf,et al. The Solution of Systems of Piecewise Linear Equations , 1976, Math. Oper. Res..

[6] C. B. García,et al. A Theorem on Homotopy Paths , 1978, Math. Oper. Res..

[7] B. Curtis Eaves,et al. Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

[8] M. Todd,et al. Efficient Acceleration Techniques for Fixed Point Algorithms , 1978 .