✦ LIBER ✦

A base reduction method for convex programming

✍ Scribed by João J.S. Sentieiro

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 226 KB
Volume: 2
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(89)90116-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exponential-function reduction method

An exponential-function reduction method for block-angular convex programs

✍ Michael D. Grigoriadis; Leonid G. Khachiyan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

## Abstract An exponential potential‐function reduction algorithm for convex block‐angular optimization problems is described. These problems are characterized by __K__ disjoint convex compact sets called blocks and __M__ non‐negative‐valued convex block‐separable coupling inequalities with a nonem

A new linesearch method for quadraticall

A new linesearch method for quadratically constrained convex programming

✍ A. Melman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 532 KB

A projected-steepest-descent potential-r

A projected-steepest-descent potential-reduction algorithm for convex programming problems

✍ Yixun Shi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

The penalty method for problems of conve

The penalty method for problems of convex programming

✍ M.A. Shepilov 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 547 KB

A class of convex programming methods

✍ E.A. Nurminskii 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 572 KB

A discrete dynamic convexized method for

A discrete dynamic convexized method for nonlinear integer programming

✍ Wenxing Zhu; Hong Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 820 KB

In this paper, we consider the box constrained nonlinear integer programming problem. We present an auxiliary function, which has the same discrete global minimizers as the problem. The minimization of the function using a discrete local search method can escape successfully from previously converge