Search Results - "Numerical methods in mathematical programming"
-
1
A comparative study of Artificial Bee Colony algorithm
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 01.08.2009Published in Applied mathematics and computation (01.08.2009)“…Artificial Bee Colony (ABC) algorithm is one of the most recently introduced swarm-based algorithms. ABC simulates the intelligent foraging behaviour of a…”
Get full text
Journal Article -
2
Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 15.07.2009Published in Applied mathematics and computation (15.07.2009)“…As indicated by the most widely accepted classification, the Multi-Objective Mathematical Programming (MOMP) methods can be classified as a priori, interactive…”
Get full text
Journal Article -
3
Gbest-guided artificial bee colony algorithm for numerical function optimization
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 01.12.2010Published in Applied mathematics and computation (01.12.2010)“…Artificial bee colony (ABC) algorithm invented recently by Karaboga is a biological-inspired optimization algorithm, which has been shown to be competitive…”
Get full text
Journal Article -
4
Iteratively reweighted least squares minimization for sparse recovery
ISSN: 0010-3640, 1097-0312Published: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.01.2010Published in Communications on pure and applied mathematics (01.01.2010)“…Under certain conditions (known as the restricted isometry property, or RIP) on the m × N matrix Φ (where m < N), vectors x ∈ ℝN that are sparse (i.e., have…”
Get full text
Journal Article -
5
Theory and Applications of Robust Optimization
ISSN: 0036-1445, 1095-7200Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2011Published in SIAM review (01.01.2011)“…In this paper we survey the primary research, both theoretical and applied, in the area of robust optimization (RO). Our focus is on the computational…”
Get full text
Journal Article -
6
SparseNet: Coordinate Descent With Nonconvex Penalties
ISSN: 0162-1459, 1537-274XPublished: Alexandria, VA Taylor & Francis 01.09.2011Published in Journal of the American Statistical Association (01.09.2011)“…We address the problem of sparse selection in linear models. A number of nonconvex penalties have been proposed in the literature for this purpose, along with…”
Get full text
Journal Article -
7
A real coded genetic algorithm for solving integer and mixed integer optimization problems
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 15.06.2009Published in Applied mathematics and computation (15.06.2009)“…In this paper, a real coded genetic algorithm named MI-LXPM is proposed for solving integer and mixed integer constrained optimization problems. The proposed…”
Get full text
Journal Article -
8
An improved harmony search algorithm for solving optimization problems
ISSN: 0096-3003, 1873-5649Published: New York, NY Elsevier Inc 15.05.2007Published in Applied mathematics and computation (15.05.2007)“…This paper develops an Improved harmony search (IHS) algorithm for solving optimization problems. IHS employs a novel method for generating new solution…”
Get full text
Journal Article -
9
An M/M/c queue model for hub covering location problem
ISSN: 0895-7177, 1872-9479Published: Kidlington Elsevier Ltd 01.12.2011Published in Mathematical and computer modelling (01.12.2011)“…The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. Hub…”
Get full text
Journal Article -
10
Global-best harmony search
ISSN: 0096-3003, 1873-5649Published: New York, NY Elsevier Inc 01.05.2008Published in Applied mathematics and computation (01.05.2008)“…Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where musicians improvise their instruments’ pitches…”
Get full text
Journal Article -
11
BOUNDS ON ELASTICITIES WITH OPTIMIZATION FRICTIONS: A SYNTHESIS OF MICRO AND MACRO EVIDENCE ON LABOR SUPPLY
ISSN: 0012-9682, 1468-0262Published: Oxford, UK Econometric Society 01.05.2012Published in Econometrica (01.05.2012)“…How can price elasticities be identified when agents face optimization frictions such as adjustment costs or inattention? I derive bounds on structural price…”
Get full text
Journal Article -
12
Bat algorithm for constrained optimization tasks
ISSN: 0941-0643, 1433-3058Published: London Springer-Verlag 01.05.2013Published in Neural computing & applications (01.05.2013)“…In this study, we use a new metaheuristic optimization algorithm, called bat algorithm (BA), to solve constraint optimization tasks. BA is verified using…”
Get full text
Journal Article -
13
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
ISSN: 0029-599X, 0945-3245Published: Heidelberg Springer 01.03.2005Published in Numerische Mathematik (01.03.2005)Get full text
Journal Article -
14
Particle swarm optimization: Hybridization perspectives and experimental illustrations
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 15.02.2011Published in Applied mathematics and computation (15.02.2011)“…Metaheuristic optimization algorithms have become popular choice for solving complex and intricate problems which are otherwise difficult to solve by…”
Get full text
Journal Article -
15
Computational methods for solving fully fuzzy linear systems
ISSN: 0096-3003, 1873-5649Published: New York, NY Elsevier Inc 01.08.2006Published in Applied mathematics and computation (01.08.2006)“…Since many real-world engineering systems are too complex to be defined in precise terms, imprecision is often involved in any engineering design process…”
Get full text
Journal Article -
16
A hybrid particle swarm optimization–back-propagation algorithm for feedforward neural network training
ISSN: 0096-3003, 1873-5649Published: New York, NY Elsevier Inc 15.02.2007Published in Applied mathematics and computation (15.02.2007)“…The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search…”
Get full text
Journal Article Conference Proceeding -
17
On the parameterized complexity of multiple-interval graph problems
ISSN: 0304-3975, 1879-2294Published: Oxford Elsevier B.V 01.01.2009Published in Theoretical computer science (01.01.2009)“…Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many…”
Get full text
Journal Article -
18
Integration, participation and optimal control in water resources planning and management
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 01.12.2008Published in Applied mathematics and computation (01.12.2008)“…Water resource systems provide a challenging testing ground for System Analysis and Optimal Control Theory. The intrinsic complexity of the physical system,…”
Get full text
Journal Article -
19
A self-adaptive global best harmony search algorithm for continuous optimization problems
ISSN: 0096-3003, 1873-5649Published: Amsterdam Elsevier Inc 01.04.2010Published in Applied mathematics and computation (01.04.2010)“…This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a…”
Get full text
Journal Article -
20
Improved artificial bee colony algorithm for global optimization
ISSN: 0020-0190, 1872-6119Published: Amsterdam Elsevier B.V 15.09.2011Published in Information processing letters (15.09.2011)“…The artificial bee colony algorithm is a relatively new optimization technique. This paper presents an improved artificial bee colony (IABC) algorithm for…”
Get full text
Journal Article