Journal: Computational Optimization and Applications

Found 579 papers in total
Global optimization techniques for solving the general quadratic integer programming problem
Global optimization techniques for solving the general quadratic integer programming problem
1998,
We consider the problem of minimizing a general quadratic function over a polytope in...
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
1998,
We present a constant-potential infeasible-start interior-point (INFCP) algorithm for...
A parallel interior point method and its application to facility location problems
A parallel interior point method and its application to facility location problems
1998,
We present a parallel interior point algorithm to solve block structured linear...
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998,
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
A hybrid smoothing method for mixed nonlinear complementarity problems
A hybrid smoothing method for mixed nonlinear complementarity problems
1998,
In this paper, we describe a new, integral-based smoothing method for solving the...
A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
1998,
This paper presents a sequential quadratic programming algorithm for computing a...
Feature minimization within decision trees
Feature minimization within decision trees
1998,
Decision trees for classification can be constructed using mathematical programming....
A logarithmic-quadratic proximal method for variational inequalities
A logarithmic-quadratic proximal method for variational inequalities
1999,
We present a new method for solving variational inequalities on polyhedra. The method...
On a primal–dual analytic center cutting plane method for variational inequalities
On a primal–dual analytic center cutting plane method for variational inequalities
1999,
We present an algorithm for variational inequalities VI( F , Y ) that uses a...
Exploiting sparsity in the direct transcription method for optimal control
Exploiting sparsity in the direct transcription method for optimal control
1999,
In the direct transcription method an approximation to an optimal control problem is...
Learning equilibrium play: A myopic approach
Learning equilibrium play: A myopic approach
1999,
We model repeated play of noncooperative stage games in terms of approximate gradient...
Quartic barriers
Quartic barriers
1999,
Many mathematical propositions are expressed in terms of a natural number n for which...
An augmentation algorithm for the maximum weighted stable set problem
An augmentation algorithm for the maximum weighted stable set problem
1999,
Edge projection is a specialization of Lovász and Plummer's clique reduction...
Optimization based algorithms for finding minimal cost ring covers in survivable networks
Optimization based algorithms for finding minimal cost ring covers in survivable networks
1999,
Designing low cost SONET networks composed of self-healing rings is an important...
A partitioned ε-relaxation algorithm for separable convex network flow problems
A partitioned ε-relaxation algorithm for separable convex network flow problems
1999,
A relaxation method for separable convex network flow problems is developed that is...
A shifted-barrier primal–dual algorithm model for linearly constrained optimization problems
A shifted-barrier primal–dual algorithm model for linearly constrained optimization problems
1999,
In this paper we describe a Newton-type algorithm model for solving smooth constrained...
On extensions of the Frank–Wolf theorems
On extensions of the Frank–Wolf theorems
1999,
In this paper we consider optimization problems defined by a quadratic objective...
First-order algorithms for generalized semi-infinite min–max problems
First-order algorithms for generalized semi-infinite min–max problems
1999,
We present a first-order algorithm for solving semi-infinite generalized min–max...
An optimal way of moving a sequence of points onto a curve in two dimensions
An optimal way of moving a sequence of points onto a curve in two dimensions
1999,
Let s (t), 0 ≤ t ≤ T , be a smooth curve and let x i , i = 1, 2, ..., n , be a...
Some optimization reformulations of the extended linear complementarity problem
Some optimization reformulations of the extended linear complementarity problem
1999,
We consider the extended linear complementarity problem (XLCP) introduced by...
On nonlinear complementarity problem functions
On nonlinear complementarity problem functions
1999,
In this paper we reformulate several NCP-functions for the nonlinear complementarity...
A linearly convergent derivative-free descent method for strongly monotone complementarity problems
A linearly convergent derivative-free descent method for strongly monotone complementarity problems
1999,
We establish the first rate of convergence result for the class of derivative-free...
Finite sample behaviour of an ergodically fast line-search algorithm
Finite sample behaviour of an ergodically fast line-search algorithm
1999,
In order to represent a line-search algorithm as a non-convergent dynamic system, we...
Topology optimization of trusses – random cost method versus evolutionary algorithms
Topology optimization of trusses – random cost method versus evolutionary algorithms
1999,
The recently proposed random cost method is applied to the topology optimization of...
Papers per page: