A superlinearly convergent method for minimization problems with linear inequality constraints

DOI10.1007/BF01584646zbMath0258.65066MaRDI QIDQ5674331

Klaus Ritter

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable Metric Method for Minimization
• A Rapidly Convergent Descent Method for Minimization
• Pseudo-Convex Functions
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints