A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems

DOI10.1137/0712024MaRDI QIDQ4057492zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(6)

• Accelerating procedures for methods of conjugate directions
• A hybrid method fur linearly constrained optimisation problems
• An active set method for solving linearly constrained nonsmooth optimization problems
• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• A method to accelerate the rate of convergence of a class of optimization algorithms
• 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

This page was built for publication: A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems

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