Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms
Authors:
- 1 October 1997
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 11 (3) , 253-285
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Global Optimization1993
- On solving a D.C. programming problem by a sequence of linear programsJournal of Global Optimization, 1991
- From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality1989
- A parallel algorithm for constrained concave quadratic global minimizationMathematical Programming, 1988
- Global minimization of indefinite quadratic problemsComputing, 1987
- Global minimization of large-scale constrained concave quadratic problems by separable programmingMathematical Programming, 1986
- Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions1985
- Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximumNumerische Mathematik, 1984
- An Introduction to Convex Polytopes1983
- A duality principle for non-convex optimisation and the calculus of variationsArchive for Rational Mechanics and Analysis, 1979