✦ LIBER ✦

A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems

✍ Scribed by Yi Shang; Benjamin W. Wah

Book ID: 110261335
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 549 KB
Volume: 12
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1008287028851

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonal Methods Based Ant Colony Sear

Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems

✍ Xiao-Min Hu; Jun Zhang; Yun Li 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 656 KB

A hybrid method for solving multi-object

A hybrid method for solving multi-objective global optimization problems

✍ C. Gil; A. Márquez; R. Baños; M. G. Montoya; J. Gómez 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 512 KB

Augmented Lagrangian Algorithms Based on

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

✍ M. A. Diniz-Ehrhardt; M. A. Gomes-Ruggiero; J. M. Martínez; S. A. Santos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 159 KB

A discrete Fourier method for solving st

A discrete Fourier method for solving strongly coupled mixed hyperbolic problems

✍ M.C. Casabán; L. Jódar; G.A. Ossandón 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Random search method for solving series

Random search method for solving series of linear programming problems

✍ A. I. Vafina; V. R. Fazylov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 203 KB

A partial parallel splitting augmented L

A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems

✍ Zheng Peng; Donghua Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Alternating directions methods (ADMs) are very effective for solving convex optimization problems with separable structure. However, when these methods are applied to solve convex optimization problems with three separable operators, their convergence results have not been established as yet. In thi