Journal: Computational Optimization and Applications

Found 579 papers in total
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
2013,
This paper presents several methodological and algorithmic improvements over a...
Multi Agent Collaborative Search based on Tchebycheff decomposition
Multi Agent Collaborative Search based on Tchebycheff decomposition
2013,
This paper presents a novel formulation of Multi Agent Collaborative Search, for...
Parameter‐less algorithm for evolutionary‐based optimization
Parameter‐less algorithm for evolutionary‐based optimization
2013,
The development of a simple, adaptive, parameter‐less search algorithm was...
A simplex‐based numerical framework for simple and efficient robust design optimization
A simplex‐based numerical framework for simple and efficient robust design optimization
2013,
The Simplex Stochastic Collocation (SSC) method is an efficient algorithm for...
A new method for solving Pareto eigenvalue complementarity problems
A new method for solving Pareto eigenvalue complementarity problems
2013,
In this paper, we introduce a new method, called the Lattice Projection Method (LPM),...
Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints
Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints
2013,
In this paper we consider a model elliptic optimal control problem with finitely many...
Stochastic Nash equilibrium problems: sample average approximation and applications
Stochastic Nash equilibrium problems: sample average approximation and applications
2013,
This paper presents a Nash equilibrium model where the underlying objective functions...
A smoothing‐regularization approach to mathematical programs with vanishing constraints
A smoothing‐regularization approach to mathematical programs with vanishing constraints
2013,
We consider a numerical approach for the solution of a difficult class of optimization...
An empirical evaluation of walk‐and‐round heuristics for mixed integer linear programs
An empirical evaluation of walk‐and‐round heuristics for mixed integer linear programs
2013,
Feasibility pump is a general purpose technique for finding feasible solutions of...
Error estimates for parabolic optimal control problems with control and state constraints
Error estimates for parabolic optimal control problems with control and state constraints
2013,
The numerical approximation to a parabolic control problem with control and state...
Parallel distributed‐memory simplex for large‐scale stochastic LP problems
Parallel distributed‐memory simplex for large‐scale stochastic LP problems
2013,
We present a parallelization of the revised simplex method for large extensive forms...
Stable local volatility function calibration using spline kernel
Stable local volatility function calibration using spline kernel
2013,
We propose an optimization formulation using the l 1 norm to ensure accuracy and...
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
2013,
We consider a network design problem that arises in the cost‐optimal design of...
A homotopy method for nonlinear semidefinite programming
A homotopy method for nonlinear semidefinite programming
2013,
In this paper, for solving the nonlinear semidefinite programming problem, a homotopy...
Using inexact gradients in a multilevel optimization algorithm
Using inexact gradients in a multilevel optimization algorithm
2013,
Many optimization algorithms require gradients of the model functions, but computing...
A derivative‐free approximate gradient sampling algorithm for finite minimax problems
A derivative‐free approximate gradient sampling algorithm for finite minimax problems
2013,
In this paper we present a derivative‐free optimization algorithm for finite...
A second‐order smooth penalty function algorithm for constrained optimization problems
A second‐order smooth penalty function algorithm for constrained optimization problems
2013,
This paper introduces a second‐order differentiability smoothing technique to...
A computational study and survey of methods for the single‐row facility layout problem
A computational study and survey of methods for the single‐row facility layout problem
2013,
The single‐row facility layout problem (SRFLP) is an NP‐hard...
Modified subspace Barzilai‐Borwein gradient method for non‐negative matrix factorization
Modified subspace Barzilai‐Borwein gradient method for non‐negative matrix factorization
2013,
Non‐negative matrix factorization (NMF) is a problem to obtain a representation...
Classification of companies using maximal margin ellipsoidal surfaces
Classification of companies using maximal margin ellipsoidal surfaces
2013,
We recently proposed a data mining approach for classifying companies into several...
Mixed‐Integer Linear Programming Formulations for the Software Clustering Problem
Mixed‐Integer Linear Programming Formulations for the Software Clustering Problem
2013,
The clustering problem has an important application in software engineering, which...
Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
2013,
This paper presents an algorithm and its implementation in the software package...
A trust region method for solving semidefinite programs
A trust region method for solving semidefinite programs
2013,
When using interior point methods for solving semidefinite programs (SDP), one needs...
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large‐scale separable convex optimization problems
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large‐scale separable convex optimization problems
2013,
A new algorithm for solving large‐scale convex optimization problems with a...
Papers per page: