On the convergence of sequential minimization algorithms

DOI10.1007/BF00934779zbMath0253.65037MaRDI QIDQ5921566

D. J. Sebastian, R. W. H. Sargent

Publication date: 1973

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (9)

Some properties of a uniformly linearly independent sequence of subspaces ⋮ Relaxation methods for problems with strictly convex separable costs and linear constraints ⋮ An efficient method for clustered multi-metric learning ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Decomposition algorithm for convex differentiable minimization ⋮ Minimization methods with constraints ⋮ On the convergence of sequential minimization algorithms ⋮ Descent methods for convex essentially smooth minimization ⋮ On the convergence of the coordinate descent method for convex differentiable minimization

Cites Work

• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Minimizing Functionals on Normed-Linear Spaces
• Convergence Conditions for Ascent Methods
• Minimizing a function without calculating derivatives
• Computational experience with quadratically convergent minimisation methods
• On search directions for minimization algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the convergence of sequential minimization algorithms