Sciweavers

5331 search results - page 80 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
EWC
2006
120views more  EWC 2006»
14 years 9 months ago
A comparison of two optimization methods for mesh quality improvement
We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measure...
Lori Freitag Diachin, Patrick M. Knupp, Todd S. Mu...
MEMETIC
2010
311views more  MEMETIC 2010»
14 years 4 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
TIP
2011
124views more  TIP 2011»
14 years 4 months ago
A Geometric Method for Optimal Design of Color Filter Arrays
—A color filter array (CFA) used in a digital camera is a mosaic of spectrally selective filters, which allows only one color component to be sensed at each pixel. The missing ...
Pengwei Hao, Yan Li, Zhouchen Lin, Eric Dubois
SIAMJO
2010
133views more  SIAMJO 2010»
14 years 8 months ago
Infeasibility Detection and SQP Methods for Nonlinear Optimization
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal