A feasible conjugate direction method to solve linearly constrained minimization problems

DOI10.1007/BF00935621MaRDI QIDQ1843375zbMATH OpenFDO

Authors Yanyan Li

Publication date 1975

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

Full work available at URL https://doi.org/10.1007/BF00935621

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3356498 (Why is no real title available?)
• scientific article; zbMATH DE number 3402375 (Why is no real title available?)
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming

Cited in

(9)

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

This page was built for publication: A feasible conjugate direction method to solve linearly constrained minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843375)