Partly Convex and Convex-Monotonic Optimization Problems

Hoang Tuy ()
Additional contact information
Hoang Tuy: Institute of Mathematics

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2005, pp 485-508 from Springer

Abstract: Summary A class of nonconvex optimization problems is studied that exhibits partial convexity combined with partial monotonicity. To exploit this particular hybrid structure a natural approach is to use a branch and bound scheme with branching performed on the nonconvex variables and bounds computed by lagrangian or convex relaxation. We discuss conditions that guarantee convergence of such branch and bound algorithms. Incidentally, several incorrect results in the recent literature on related subjects are reviewed.

Keywords: Nonconvex optimization; hybrid convex-monotonic optimization; partly convex programming; branch and bound method; lagrangian relaxation; dual bound; consistent bound (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-540-27170-3_37

Ordering information: This item can be ordered from
http://www.springer.com/9783540271703

DOI: 10.1007/3-540-27170-8_37

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().