Sciweavers

14739 search results - page 64 / 2948
» An optimization problem on the sphere
Sort
View
JSAT
2006
114views more  JSAT 2006»
14 years 10 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
HM
2007
Springer
114views Optimization» more  HM 2007»
15 years 1 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss
IPPS
2007
IEEE
15 years 4 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
TNN
2008
108views more  TNN 2008»
14 years 9 months ago
A Novel Recurrent Neural Network for Solving Nonlinear Optimization Problems With Inequality Constraints
This paper presents a novel recurrent neural network for solving nonlinear optimization problems with inequality constraints. Under the condition that the Hessian matrix of the ass...
Youshen Xia, Gang Feng, Jun Wang
MOC
2002
101views more  MOC 2002»
14 years 9 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu