✦ LIBER ✦

Piece adding technique for convex maximization problems

✍ Scribed by Dominique Fortin; Ider Tseveendorj

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 218 KB
Volume: 48
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-009-9506-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Piecewise Convex Maximization Problems:

Piecewise Convex Maximization Problems: Piece Adding Technique

✍ Dominique Fortin; Ider Tseveendorj 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 549 KB

A Numerical Approach for Solving Some Co

A Numerical Approach for Solving Some Convex Maximization Problems

✍ R. Enkhbat; B. Barsbold; Masaru Kamada 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 128 KB

Lower bounds for maximal and convex laye

Lower bounds for maximal and convex layers problems

✍ Sanjiv Kapoor; Prakash Ramanan 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 668 KB

A technique for adding range restriction

A technique for adding range restrictions to generalized searching problems

✍ Prosenjit Gupta; Ravi Janardan; Michiel Smid 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 681 KB

In a generalized searching problem, a set S of n colored geometric objects has to be stored in a data structure, such that for any given query object q, the distinct colors of the objects of S intersected by q can be reported efficiently. In this paper, a general technique is presented for adding a

On the relation between concavity cuts a

On the relation between concavity cuts and the surrogate dual for convex maximization problems

✍ Marco Locatelli; Fabio Schoen 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 156 KB

An unconstrained optimization technique

An unconstrained optimization technique for large-scale linearly constrained convex minimization problems

✍ C. Kanzow 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 773 KB