Journal: Computational Optimization and Applications

Found 579 papers in total
A computational study of the homogeneous algorithm for large-scale convex optimization
A computational study of the homogeneous algorithm for large-scale convex optimization
1998,
Recently the authors have proposed a homogeneous and self-dual algorithm for solving...
On improvements to the analytic center cutting plane method
On improvements to the analytic center cutting plane method
1998,
In this paper, we explore a weakness of a specific implementation of the analytic...
Solving the minimum weighted integer coloring problem
Solving the minimum weighted integer coloring problem
1998,
In this paper, we present, as far as we are aware of, the first combinatorial...
The application of preprocessing and cutting plane techniques for a class of production planning problems
The application of preprocessing and cutting plane techniques for a class of production planning problems
1998,
This paper investigates properties of integer programming models for a class of...
A new steepest edge approximation for the simplex method for linear programming
A new steepest edge approximation for the simplex method for linear programming
1998,
The purpose of this paper is to present a new steepest edge (SE) approximation scheme...
Parsimonious least norm approximation
Parsimonious least norm approximation
1998,
A theoretically justifiable fast finite successive linear approximation algorithm is...
Minimizing a sum of norms subject to linear equality constraints
Minimizing a sum of norms subject to linear equality constraints
1998,
Numerical analysis of a class of nonlinear duality problems is presented. One side of...
Superlinear convergence of a stabilized sequential quadratic programming method to a degenerate solution
Superlinear convergence of a stabilized sequential quadratic programming method to a degenerate solution
1998,
We describe a slight modification of the well-known sequential quadratic programming...
A global regularization method for solving the finite min–max problem
A global regularization method for solving the finite min–max problem
1998,
A method is presented for solving the finite nonlinear min–max problem....
A structured reduced sequential quadratic programming and its application to a shape design problem
A structured reduced sequential quadratic programming and its application to a shape design problem
1998,
The objective of this work is to solve a model one dimensional duct design problem...
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...
Local convergence of the symmetric rank-one iteration
Local convergence of the symmetric rank-one iteration
1998,
We consider conditions under which the SR1 iteration is locally convergent. We apply...
Using forward accumulation for automatic differentiation of implicitly-defined functions
Using forward accumulation for automatic differentiation of implicitly-defined functions
1998,
This paper deals with the calculation of partial derivatives (w.r.t. the independent...
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...
An interior-point method for approximate positive semidefinite completions
An interior-point method for approximate positive semidefinite completions
1998,
Given a nonnegative, symmetric matrix of weights, H , we study the problem of finding...
Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces
Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces
1998,
This work is concerned with the analysis of convergence properties of feasible descent...
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...
Metaheuristics for high school timetabling
Metaheuristics for high school timetabling
1998,
In this paper we present the results of an investigation of the possibilities offered...
Branch-and-price algorithms for the one-dimensional cutting stock problem
Branch-and-price algorithms for the one-dimensional cutting stock problem
1998,
We compare two branch-and-price approaches for the cutting stock problem. Each...
On the solution of linear recurrence equations
On the solution of linear recurrence equations
1998,
In this article, we present a general solution for linear divide-and-conquer...
The capacitated arc routing problem: Valid inequalities and facets
The capacitated arc routing problem: Valid inequalities and facets
1998,
In this paper we study the polyhedron associated with the Capacitated Arc Routing...
Projection with a minimal system of inequalities
Projection with a minimal system of inequalities
1998,
Projection of a polyhedron involves the use of a cone whose extreme rays induce the...
Global and superlinear convergence of a restricted class and self-scaling methods with inexact line searches, for convex functions
Global and superlinear convergence of a restricted class and self-scaling methods with inexact line searches, for convex functions
1998,
This paper studies the convergence properties of algorithms belonging to the class of...
Decomposition methods for differentiable optimization problems over Cartesian product sets
Decomposition methods for differentiable optimization problems over Cartesian product sets
1998,
This paper presents a unified analysis of decomposition algorithms for continuously...
Papers per page: