Parametric Decomposition

Hoang Tuy
Additional contact information
Hoang Tuy: Institute of Mathematics

Chapter Chapter 9 in Convex Analysis and Global Optimization, 2016, pp 283-336 from Springer

Abstract: Abstract A partly convex problem can also be viewed as a convex optimization problem depending upon a parameter x ∈ ℝ n . $$ x \in \mathbb{R}^{n}. $$ In the preceding chapter, for solving this parametric convex optimization problem, a BB Algorithm has been proposed which branches upon the space of the parameter x and operates basically as a decomposition method that reduces the problem to a sequence of easier subproblems. The present chapter deals with the important case when n is small. It turns out that in that case the problem can be solved by streamlined decomposition methods of parametric programming.

Date: 2016
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:spochp:978-3-319-31484-6_9

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

DOI: 10.1007/978-3-319-31484-6_9

Access Statistics for this chapter

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