A superlinearly convergent method for minimization problems with linear inequality constraints

DOI10.1007/BF01584646MaRDI QIDQ5674331zbMATH OpenFDO

Authors Klaus Ritter

Publication date 1973

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites work

• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3366716 (Why is no real title available?)
• scientific article; zbMATH DE number 3366717 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• A Rapidly Convergent Descent Method for Minimization
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Pseudo-Convex Functions
• Variable Metric Method for Minimization

Cited in

(4)

• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• A quasi-Newton method for minimization under linear constraints without evaluating any derivatives
• 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 globally and quadratically convergent algorithm for general nonlinear programming problems

This page was built for publication: A superlinearly convergent method for minimization problems with linear inequality constraints

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