A feasible conjugate direction method to solve linearly constrained minimization problems

DOI10.1007/BF00935621zbMath0281.90063MaRDI QIDQ1843375

Yanyan Li

Publication date: 1975

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

Mathematics Subject Classification ID

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

Related Items

A hybrid method fur linearly constrained optimisation problems, A new objective function for analyzing hydraulic pipe networks in the presence of different states of flow, A method to accelerate the rate of convergence of a class of optimization algorithms, Inelastic analysis of suspension structures by nonlinear programming, Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems, Optimization of electrical circuits, Algorithmes de programmation convexe par linéarisation en format constant, An accelerated conjugate direction method to solve linearly constrained minimization problems, Mathematical programming and nonlinear finite element analysis

Cites Work

• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item