A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems

DOI10.1137/0712024zbMath0302.65053OpenAlexW2085297556MaRDI QIDQ4057492

Klaus Ritter

Publication date: 1975

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0712024

Mathematics Subject Classification ID

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

Related Items

A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, A hybrid method fur linearly constrained optimisation problems, An active set method for solving linearly constrained nonsmooth optimization problems, A method to accelerate the rate of convergence of a class of optimization algorithms, Accelerating procedures for methods of conjugate directions, A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems