Sciweavers

357 search results - page 8 / 72
» Solving Generalized Maximum Dispersion with Linear Programmi...
Sort
View
JMLR
2010
128views more  JMLR 2010»
13 years 6 months ago
Iterative Scaling and Coordinate Descent Methods for Maximum Entropy Models
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...
Fang-Lan Huang, Cho-Jui Hsieh, Kai-Wei Chang, Chih...
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
13 years 12 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 7 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 7 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 7 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell