Sciweavers

550 search results - page 5 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
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...
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
14 years 1 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
PARMA
2004
174views Database» more  PARMA 2004»
13 years 9 months ago
Fuzzy Miner - A Fuzzy System for Solving Pattern Classification Problems
The purpose of this paper is to study the problem of pattern classification as this is presented in the context of data mining. Among the various approaches we focus on the use of ...
Nikos Pelekis, Babis Theodoulidis, Ioannis Kopanak...
CDC
2010
IEEE
13 years 2 months ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh
WCE
2007
13 years 8 months ago
Local Approximation of Pareto Surface
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov