A Numerical Method for Concave Programming Problems
Authors:
- 11 February 2006
- book chapter
- Published by Springer Nature
- p. 251-273
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the VariablesSIAM Journal on Optimization, 1996
- An algorithm for maximizing a convex function over a simple setJournal of Global Optimization, 1996
- Global optimization conditions for certain nonconvex minimization problemsJournal of Global Optimization, 1994
- Complexity in Numerical Optimization1993
- Global Optimization1993
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality1989
- Checking local optimality in constrained quadratic programming is NP-hardOperations Research Letters, 1988
- Constrained Global Optimization: Algorithms and Applications1987
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986