Secant approximation methods for convex optimization
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 143-162
- https://doi.org/10.1007/bfb0120926
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Two-Segment Separable ProgrammingManagement Science, 1979
- Solving the Pipe Network Analysis Problem Using Optimization TechniquesManagement Science, 1978
- Objective function approximations in mathematical programmingMathematical Programming, 1977
- A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramSIAM Journal on Control and Optimization, 1977
- The Boxstep Method for Large-Scale OptimizationOperations Research, 1975
- An algorithm for solving linearly constrained optimization problemsMathematical Programming, 1972
- On the continuity of the minimum set of a continuous functionJournal of Mathematical Analysis and Applications, 1967
- A Nonlinear Programming Technique for the Optimization of Continuous Processing SystemsManagement Science, 1961
- A Linear Programming Approach to the Chemical Equilibrium ProblemManagement Science, 1958
- Minimization of non‐linear separable convex functionalsNaval Research Logistics Quarterly, 1954