A language for nonlinear programming problems
From MaRDI portal
Publication:5653824
DOI10.1007/BF01584542zbMATH Open0242.90062MaRDI QIDQ5653824FDOQ5653824
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Slacked Unconstrained Minimization Technique for Convex Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
Cited In (4)
- Computer-generated interval extensions of factorable functions and their derivatives
- A modified Newton's method for minimizing factorable functions
- Inverting an interval Hessian of a factorable function
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
This page was built for publication: A language for nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653824)
