Journal: Computational Optimization and Applications

Found 579 papers in total
On the resolution of monotone complementarity problems
On the resolution of monotone complementarity problems
1996,
A reformulation of the nonlinear complementarity problem (NCP) as an unconstrained...
Numerical experiments in semi-infinite programming
Numerical experiments in semi-infinite programming
1996,
A quasi-Newton algorithm for semi-infinite programming using an L ∞ exact...
A comparison of large scale mixed complementarity problem solvers
A comparison of large scale mixed complementarity problem solvers
1997,
This paper provides a means for comparing various computer codes for solving large...
Impact of partial separability on large-scale optimization
Impact of partial separability on large-scale optimization
1997,
ELSO is an environment for the solution of large-scale optimization problems. With...
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
1997,
This paper considers the number of inner iterations required per outer iteration for...
Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
1997,
Recently, a very general class of truncated Newton methods has been proposed for...
Sequential quadratic programming methods for large-scale problems
Sequential quadratic programming methods for large-scale problems
1997,
Sequential quadratic programming (SQP) methods are the method of choice when solving...
Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
1997,
In this paper, a new nonmonotone Broyden–Fletcher–Goldfarb–Shanno...
Metric-based symmetric rank-one updates
Metric-based symmetric rank-one updates
1997,
Metric-based symmetric rank-one (SR1) updates which are stabilized by a variational...
An infeasible point method for minimizing the Lennard–Jones potential
An infeasible point method for minimizing the Lennard–Jones potential
1997,
Minimizing the Lennard–Jones potential, the most-studied model problem for...
A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
1997,
We present a computationally efficient implementation of an interior point algorithm...
A new algorithm for solving the general quadratic programming problem
A new algorithm for solving the general quadratic programming problem
1996,
For the general quadratic programming problem (including an equivalent form of the...
The two-period travelling salesman problem applied to milk collection in Ireland
The two-period travelling salesman problem applied to milk collection in Ireland
1997,
We describe a new extension to the Symmetric Travelling Salesman Problem (STSP) in...
A heuristic for the Steiner problem in graphs
A heuristic for the Steiner problem in graphs
1996,
In this paper, we present a heuristic for the Steiner problem in graphs along with...
A complementarity approach to a quasistatic multi-rigid-body contact problem
A complementarity approach to a quasistatic multi-rigid-body contact problem
1996,
In this paper, we study the problem of predicting the quasistatic planar motion of a...
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
1997,
We prove that the existence of a polynomial time ρ-approximation algorithm (where...
Annealing algorithms for multisource absolute location problems on graph
Annealing algorithms for multisource absolute location problems on graph
1997,
A methodology is presented for applying annealing techniques to multisource absolute...
A hypergraph framework for optimal model-based decomposition of design problems
A hypergraph framework for optimal model-based decomposition of design problems
1997,
Decomposition of large engineering system models is desirable since increased model...
Asynchronous gradient algorithms for a class of convex separable network flow problems
Asynchronous gradient algorithms for a class of convex separable network flow problems
1996,
We consider the single commodity strictly convex network flow problem. The dual of...
A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
1996,
The purpose of this study is to describe a data parallel primal–dual augmenting...
Solution of an equiweighted minimax location problem on a hemisphere
Solution of an equiweighted minimax location problem on a hemisphere
1996,
A particular continuous single facility minimax location problem on the surface of a...
Nonmonotone curvilinear line search methods for unconstrained optimization
Nonmonotone curvilinear line search methods for unconstrained optimization
1996,
We present a new algorithmic framework for solving unconstrained minimization problems...
A new neuristic algorithm solving the linear ordering problem
A new neuristic algorithm solving the linear ordering problem
1996,
The linear ordering problem is an NP ·hard combinatorial problem with a large...
On an algorithm solving two-level programming problems with nonunique lower level solutions
On an algorithm solving two-level programming problems with nonunique lower level solutions
1996,
In the paper, an algorithm is presented for solving two-level programming problems....
Papers per page: