A superlinearly convergent method for minimization problems with linear inequality constraints
From MaRDI portal
Publication:5674331
DOI10.1007/BF01584646zbMATH Open0258.65066MaRDI QIDQ5674331FDOQ5674331
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
