A quasi-Newton method for minimization under linear constraints without evaluating any derivatives

DOI10.1007/BF02253133zbMath0401.65039MaRDI QIDQ1255302

J. Bräuninger

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

AlgorithmConvergenceNumerical ExamplesNonlinear OptimizationLinear ConstraintyProjected Newton-MethodSuperlinear Convergence

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)

Related Items (1)

Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives

Cites Work

• An effective algorithm for minimization
• A superlinearly convergent method for minimization problems with linear inequality constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A quasi-Newton method for minimization under linear constraints without evaluating any derivatives