Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMIS
2010
190views more  SIAMIS 2010»
9 years 9 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
EUSFLAT
2009
155views Fuzzy Logic» more  EUSFLAT 2009»
10 years 15 days ago
A Generalized Numerical Solution for Fuzzy Relation Equations
In this paper, line search based on Sequential Quadratic Programming is implemented in order to find a solution to Fuzzy Relation Equations. Sequential Quadratic Programming is a g...
Iman Mohammadi Ardehali, Milad Avazbeigi
JMLR
2010
143views more  JMLR 2010»
10 years 1 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
MP
2008
129views more  MP 2008»
10 years 2 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
AMC
2008
88views more  AMC 2008»
10 years 2 months ago
Global convergence of a modified spectral FR conjugate gradient method
Abstract: The nonlinear conjugate gradient method is widely used in unconstrained optimization. However, the line search is very difficult or expensive sometimes. In this paper, we...
Shou-qiang Du, Yuan-yuan Chen
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
10 years 7 months ago
BBOB-benchmarking two variants of the line-search algorithm
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two diļ¬€erent univariate search algorithms (fminbnd from MATLAB and STEP) were...
Petr Posik
HPCC
2007
Springer
10 years 9 months ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
ASIAMS
2007
IEEE
10 years 9 months ago
Modified Line Search Method for Global Optimization
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
Crina Grosan, Ajith Abraham
books