Sciweavers

5331 search results - page 15 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SIAMMAX
2010
156views more  SIAMMAX 2010»
13 years 2 months ago
Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...
Roland Herzog, Ekkehard W. Sachs
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
14 years 1 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
JCST
2008
134views more  JCST 2008»
13 years 7 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
14 years 2 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...