Journal: Annals of Operations Research

Found 3339 papers in total
An efficient hybrid conjugate gradient method for unconstrained optimization
An efficient hybrid conjugate gradient method for unconstrained optimization
2001,
Recently, we propose a nonlinear conjugate gradient method, which produces a descent...
Globally convergent Broyden-like methods for semismooth equations and applications to variational inequality problems, nonlinear complementarity problems and mixed complementarity problems
Globally convergent Broyden-like methods for semismooth equations and applications to variational inequality problems, nonlinear complementarity problems and mixed complementarity problems
2001,
In this paper, we propose a general smoothing Broyden-like quasi-Newton method for...
High-resolution color image reconstruction with Neumann boundary conditions
High-resolution color image reconstruction with Neumann boundary conditions
2001,
This paper studies the application of preconditioned conjugate gradient methods in...
A predictor–corrector algorithm for quadratic semi-definite programming combining Dikin-type and Newton centering steps
A predictor–corrector algorithm for quadratic semi-definite programming combining Dikin-type and Newton centering steps
2001,
Recently, we have extended Semi-Definite Programming by adding a quadratic term in the...
Global convergence of conjugate gradient methods without line search
Global convergence of conjugate gradient methods without line search
2001,
Global convergence results are derived for well-known conjugate gradient methods in...
A conic trust-region method for nonlinearly constrained optimization
A conic trust-region method for nonlinearly constrained optimization
2001,
Trust-region methods are powerful optimization methods. The conic model method is a...
A survey of quasi-Newton equations and quasi-Newton methods for optimization
A survey of quasi-Newton equations and quasi-Newton methods for optimization
2001,
Quasi-Newton equations play a central role in quasi-Newton methods for optimization...
Nonlinear Lagrangian functions and applications to semi-infinite programs
Nonlinear Lagrangian functions and applications to semi-infinite programs
2001,
In this paper a nonlinear penalty method via a nonlinear Lagrangian function is...
A combined algorithm for fractional programming
A combined algorithm for fractional programming
2001,
In this paper, we present an outer approximation algorithm for solving the following...
FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
2001,
We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an...
Solving general capacity problem by relaxed cutting plane approach
Solving general capacity problem by relaxed cutting plane approach
2001,
This paper studies a class of infinite dimensional linear programming problems known...
On the solution of linear programs by Jacobian smoothing methods
On the solution of linear programs by Jacobian smoothing methods
2001,
We introduce a class of algorithms for the solution of linear programs. This class is...
High order long-step methods for solving linear complementarity problems
High order long-step methods for solving linear complementarity problems
2001,
The paper is concerned with methods for solving linear complementarity problems (LCP)...
Modified block symmetric successive over-relaxation (SSOR) preconditioners for symmetric positive definite linear systems
Modified block symmetric successive over-relaxation (SSOR) preconditioners for symmetric positive definite linear systems
2001,
A class of modified block SSOR preconditioners is presented for the symmetric positive...
Symmetric and non-symmetric Abaffy, Broyden and Spedicato (ABS) methods for solving Diophantine systems of equations
Symmetric and non-symmetric Abaffy, Broyden and Spedicato (ABS) methods for solving Diophantine systems of equations
2001,
In the present paper we describe a new class of algorithms for solving Diophantine...
An extension of the roots separation theorem
An extension of the roots separation theorem
2001,
Let T n be an n × n unreduced symmetric tridiagonal matrix with eigenvalues...
An adaptive conjugate gradient normal residuals algorithm for solving large linear systems
An adaptive conjugate gradient normal residuals algorithm for solving large linear systems
2001,
In this paper, an adaptive algorithm based on the normal equations for solving large...
The theory of SML schema-directed query
The theory of SML schema-directed query
2001,
SML is a modeling language for the structured modeling framework, which represents the...
On a profit maximizing location model
On a profit maximizing location model
2001,
In this paper we discuss a locational model with a profit-maximizing objective. The...
Data perturbations of matrices of pairwise comparisons
Data perturbations of matrices of pairwise comparisons
2001,
This paper deals with data perturbations of pairwise comparison matrices (PCM)....
Solving strategies and well-posedness in linear semi-infinite programming
Solving strategies and well-posedness in linear semi-infinite programming
2001,
In this paper we introduce the concept of solving strategy for a linear semi-infinite...
On linear and linearized generalized semi-infinite optimization problems
On linear and linearized generalized semi-infinite optimization problems
2001,
We consider the local and global topological structure of the feasible set M of a...
On logarithmic smoothing of the maximum function
On logarithmic smoothing of the maximum function
2001,
We consider the maximum function f resulting from a finite number of smooth functions....
One-parametric linear–quadratic optimization problems
One-parametric linear–quadratic optimization problems
2001,
We consider families of optimization problems with quadratic object function and...
Papers per page: