An accelerated conjugate direction method to solve linearly constrained minimization problems

DOI10.1016/S0022-0000(75)80055-9zbMath0349.90098MaRDI QIDQ1235063

Michael J. Best, Klaus Ritter

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05)

Related Items

Linearly constrained optimization ⋮ A method to accelerate the rate of convergence of a class of optimization algorithms ⋮ Inelastic analysis of suspension structures by nonlinear programming ⋮ Accelerating procedures for methods of conjugate directions ⋮ Optimization of electrical circuits ⋮ Mathematical modelling of early diabetes mellitus ⋮ A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems

Cites Work

• A feasible conjugate direction method to solve linearly constrained minimization problems
• Minimization of functions having Lipschitz continuous first partial derivatives
• The Variable Reduction Method for Nonlinear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item