A Finite Algorithm for a Particular D.C. Quadratic Programming Problem

Riccardo Cambini () and Claudio Sodini ()

Annals of Operations Research, 2002, vol. 117, issue 1, 33-49

Abstract: In this paper a particular quadratic minimum program, having a particular d.c. objective function, is studied. Some theoretical properties of the problem are stated and the existence of minimizers is characterized. A solution algorithm, based on the so called “optimal level solutions” approach, is finally proposed. Copyright Kluwer Academic Publishers 2002

Keywords: quadratic programming; optimal level solutions; d.c. optimization (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1021509220392 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:117:y:2002:i:1:p:33-49:10.1023/a:1021509220392

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1021509220392

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().