Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions-Reference-Cited by-同舟云学术

Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions

Published:1982-12 Issue:1 Volume:24 Page:241-256
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Lemarechal C.,Mifflin R.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01585109.pdf

Reference8 articles.

1. E.W. Cheney and A.A. Goldstein, “Newton's methods for convex programming and Tchebycheff approximation”,Numerische Mathematik 1 (1959) 253–268.

2. J.E. Kelley, “The cutting plane method for solving convex programs”,Journal of the Society for Industrial and Applied Mathematics 8 (1960) 703–712.

3. C. Lemarechal, “Nonsmooth optimization and descent methods”, RR 78-4, International Institute for Applied Systems Analysis, Laxenburg, Austria (1978).

4. R. Mifflin, “A modification and extension of Lemarechal's algorithm for nonsmooth minimization”, in: D. Sorensen and R. Wets, eds.,Nondifferential and variational techniques in optimization, Mathematical Programming Study 17 (1982) 77–90.

5. R. Mifflin, “A superlinearly convergent algorithm for one-dimensional constrained minimization problems with convex functions”,Mathematics of Operations Research, to appear.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beyond First Order: V U $$\mathcal {V}\mathcal {U}$$ -Decomposition Methods;Numerical Nonsmooth Optimization;2020

2. A fast gradient and function sampling method for finite-max functions;Computational Optimization and Applications;2018-08-23

3. A -algorithm for convex minimization;Mathematical Programming;2005-07-14

4. A new class of memory gradient methods with inexact line searches;Journal of Numerical Mathematics;2005-01-01

5. Convergence of line search methods for unconstrained optimization;Applied Mathematics and Computation;2004-10