Some experiments on heuristic code selection versus numerical performance in nonlinear programming
From MaRDI portal
Cites work
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Algorithm 746: PCOMP—a Fortran code for automatic differentiation
- Global optimization
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 4053361 (Why is no real title available?)
- scientific article; zbMATH DE number 4114398 (Why is no real title available?)
- More test examples for nonlinear programming codes
- Test example for nonlinear programming codes
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(4)- SLP-IOR: An interactive model management system for stochastic linear programs
- On the formulation of stochastic linear programs using algebraic modelling languages
- scientific article; zbMATH DE number 4155780 (Why is no real title available?)
- scientific article; zbMATH DE number 1203311 (Why is no real title available?)
This page was built for publication: Some experiments on heuristic code selection versus numerical performance in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804054)