Zum heutigen Stand der nichtlinearen Optimierungstheorie
From MaRDI portal
Publication:5532896
DOI10.1007/BF01918308zbMath0153.49102MaRDI QIDQ5532896
Publication date: 1968
Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)
Related Items (2)
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ Ableitungsfreie Verfahren für nichtlineare Optimierungsprobleme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- Convex Programming by Tangential Approximation
- Non-Linear Programming—A Survey
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Decomposition Algorithm for Linear Programs
- Accelerating the Cutting Plane Method for Nonlinear Programming
- The Duoplex Method in Nonlinear Programming
- Nonlinear Programming: A Numerical Survey
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Zum heutigen Stand der nichtlinearen Optimierungstheorie