Country: Netherlands

Found 18376 papers in total
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...
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
1999,
A simple and unified analysis is provided on the rate of local convergence for a class...
Primal–dual path-following algorithms for determinant maximization problems with linear matrix inequalities
Primal–dual path-following algorithms for determinant maximization problems with linear matrix inequalities
1999,
Primal–dual path-following algorithms are considered for determinant...
Constraint satisfaction problems: Algorithms and applications
Constraint satisfaction problems: Algorithms and applications
1999,
A constraint satisfaction problem (CSP) requires a value, selected from a given finite...
Arbitrary-norm separating plane
Arbitrary-norm separating plane
1999,
A plane separating two point sets in n -dimensional real space is constructed such...
Solving an assignment–selection problem with verbal information and using genetic algorithms
Solving an assignment–selection problem with verbal information and using genetic algorithms
1999,
The assignment–selection problems deal with finding the best one-to-one match...
A note on error bounds for convex and nonconvex programs
A note on error bounds for convex and nonconvex programs
1999,
Given a single feasible solution x F and a single infeasible solution x l of a...
Optimal stopping problem with finite-period reservation
Optimal stopping problem with finite-period reservation
1999,
This paper presents a discrete-time optimal stopping problem with a finite planning...
A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
1999,
In this paper, a computational algorithm, named RST2ANU algorithm, has been developed...
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
1999,
An arbitrary starting variable dimension algorithm is proposed to compute an integer...
Collision computation of moving bodies
Collision computation of moving bodies
1999,
In this paper, an explicit mathematical representation of n -dimensional bodies moving...
An optimality cut for mixed integer linear programs
An optimality cut for mixed integer linear programs
1999,
We derive the penalty cut, a simple optimality cut of general applicability in pure or...
Dual decomposition in stochastic integer programming
Dual decomposition in stochastic integer programming
1999,
We present an algorithm for solving stochastic integer programming problems with...
Convergence and error bound for perturbation of linear programs
Convergence and error bound for perturbation of linear programs
1999,
In various penalty/smoothing approaches to solving a linear program, one regularizes...
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
1999,
This paper addresses the issues involved with an interior point-based decomposition...
Stabilization of interior-point methods for linear programming
Stabilization of interior-point methods for linear programming
1999,
The paper studies numerical stability problems arising in the application of...
A deterministic approach to linear programs with several additional multiplicative constraints
A deterministic approach to linear programs with several additional multiplicative constraints
1999,
We consider a global optimization problem of minimizing a linear function subject to p...
Remarks on the numerical solution of certain linear complementarity problems
Remarks on the numerical solution of certain linear complementarity problems
1997,
In a recent paper, J.K. Aitchison and N.K. Upton have proposed a mathematical model of...
Solving Euclidean distance matrix completion problems via semidefinite programming
Solving Euclidean distance matrix completion problems via semidefinite programming
1999,
Given a partial symmetric matrix A with only certain elements specified, the Euclidean...
QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
1999,
We describe a technique for generating a special class, called QPEC, of mathematical...
Computational study of the relationships between feasible and efficient sets and an approximation
Computational study of the relationships between feasible and efficient sets and an approximation
1999,
The computational difficulty of obtaining the efficient set in multi-objective...
Database structures for mathematical programming models
Database structures for mathematical programming models
1997,
In the design and use of large-scale mathematical programming systems, a substantial...
Papers per page: