Journal: Optimization Methods & Software

Found 74 papers in total
Branch and bound algorithms for the multidimensional assignment problem
Branch and bound algorithms for the multidimensional assignment problem
2005,
This work investigates two branch and bound algorithms based on different tree...
Gradient projection methods for quadratic programs and applications in training support vector machines
Gradient projection methods for quadratic programs and applications in training support vector machines
2005,
Gradient projection methods based in the Barzilai–Borwein spectral steplength...
Parallel algorithm for support vector machines training and quadratic optimization problems
Parallel algorithm for support vector machines training and quadratic optimization problems
2005,
We consider an iterative algorithm, suitable for parallel implementation, to solve...
Dynamical approaches and multi-quadratic integer programming for seizure prediction
Dynamical approaches and multi-quadratic integer programming for seizure prediction
2005,
In this article, we present dynamical approaches and multi-quadratic integer...
Inverse nonlinear multicommodity flow optimization by column generation
Inverse nonlinear multicommodity flow optimization by column generation
2003,
We present a solution algorithm for an inverse nonlinear multicommodity network flow...
Polynomial interior point cutting plane methods
Polynomial interior point cutting plane methods
2003,
Polynomial cutting plane methods based on the logarithmic barrier function and on the...
Multiple criteria linear programming approach to data mining: models, algorithm designs and software development
Multiple criteria linear programming approach to data mining: models, algorithm designs and software development
2003,
It is well known that data mining has been implemented by statistical regressions,...
Second order cone programming relaxation of a positive semidefinite constraint
Second order cone programming relaxation of a positive semidefinite constraint
2003,
The positive semidefinite constraint for the variable matrix in semidefinite...
Optimal replacement of a system according to a semi-Markov decision process in a semi-Markov environment
Optimal replacement of a system according to a semi-Markov decision process in a semi-Markov environment
2003,
This paper investigates an optimal replacement problem of a system in a semi-Markov...
Randomized heuristics for the max-cut problem
Randomized heuristics for the max-cut problem
2002,
Given an undirected graph with edge weights, the max-cutproblem consists in finding a...
A primal–dual interior-point method for linear optimization based on a new proximity function
A primal–dual interior-point method for linear optimization based on a new proximity function
2002,
In this article we present a generic primal–dual interior-point algorithm for...
Dynamic large-update primal–dual interior-point method for linear optimization
Dynamic large-update primal–dual interior-point method for linear optimization
2002,
Primal–dual interior-point methods (IPMs) have shown their power in solving...
Slice models in general purpose modeling systems: An application to data envelopment analysis
Slice models in general purpose modeling systems: An application to data envelopment analysis
2002,
Slice models are collections of mathematical programs with the same structure but...
A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
2002,
This article addresses the Capacitated Plant Location Problem with Multiple Facilities...
A complexity analysis of local search algorithms in global optimization
A complexity analysis of local search algorithms in global optimization
2002,
In this paper, a complexity analysis is performed for an algorithm which solves the...
New rollout algorithms for combinatorial optimization problems
New rollout algorithms for combinatorial optimization problems
2002,
Rollout algorithms are new computational approaches used to determine near-optimal...
A modified trust region algorithm
A modified trust region algorithm
2002,
In this article, we propose an algorithm which solves unconstrained optimization...
Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints
Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints
2002,
We analyze three variants of analytic barrier methods for minimization of a convex...
A branch and bound method for stochastic integer problems under probabilistic constraints
A branch and bound method for stochastic integer problems under probabilistic constraints
2002,
Stochastic integer programming problems under probabilistic constraints are...
On a dual method for a specially structured linear programming problem with application to stochastic programming
On a dual method for a specially structured linear programming problem with application to stochastic programming
2002,
This article revises and improves on a Dual Type Method, developed by Prékopa,...
An infeasible interior-point method with nonmonotonic complementarity gaps
An infeasible interior-point method with nonmonotonic complementarity gaps
2002,
This article describes an infeasible interior-point (IP) method for solving monotone...
LPAKO: A simplex-based linear programming program
LPAKO: A simplex-based linear programming program
2002,
LPAKO is a public domain simplex-based linear programming program which can solve...
Discovering the characteristics of mathematical programs via sampling
Discovering the characteristics of mathematical programs via sampling
2002,
It is often important to know more about the characteristics of a mathematical program...
A Riccati-based primal interior point solver for multistage stochastic programming – extensions
A Riccati-based primal interior point solver for multistage stochastic programming – extensions
2002,
We show that a Riccati-based Multistage Stochastic Programming Solver for problems...
Papers per page: