Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid
- 11 October 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 94 (1) , 167-178
- https://doi.org/10.1016/0377-2217(95)00199-9
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An interior point algorithm to solve computationally difficult set covering problemsMathematical Programming, 1991
- Computational experience with an interior point algorithm on the satisfiability problemAnnals of Operations Research, 1990
- An approach to obtaining global extremums in polynomial mathematical programming problemsCybernetics and Systems Analysis, 1988
- Newton’s Method Estimates from Data at One PointPublished by Springer Nature ,1986
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- Newton’s Method with a Model Trust Region ModificationSIAM Journal on Numerical Analysis, 1982
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Smoothing by spline functions. IINumerische Mathematik, 1971
- Smoothing by spline functionsNumerische Mathematik, 1967
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966