Roos C.

C. Roos

Information about the author C. Roos will soon be added to the site.
Found 30 papers in total
Generic primal–dual interior point methods based on a new kernel function
Generic primal–dual interior point methods based on a new kernel function
2008
In this paper we present generic primal–dual interior point methods (IPMs) for...
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
2005
Interior-point methods (IPMs) for semidefinite optimization (SDO) have been studied...
A polynomial primal–dual Dikin-type algorithm for linear programming
A polynomial primal–dual Dikin-type algorithm for linear programming
1996
In this paper we present a new primal–dual affine scaling method for linear...
On implementing a primal–dual interior-point method for conic quadratic optimization
On implementing a primal–dual interior-point method for conic quadratic optimization
2003
Based on the work of the Nesterov and Todd on self-scaled cones an implementation of a...
Self-regular functions and new search directions for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
2002
In this paper, we introduce the notion of a self-regular function. Such a function is...
New complexity analysis of the primal–dual Newton method for linear optimization
New complexity analysis of the primal–dual Newton method for linear optimization
2000
We deal with the primal–dual Newton method for linear optimization (LO)....
New complexity analysis of the primal–dual method for semidefinite optimization based on the Nesterov–Todd direction
New complexity analysis of the primal–dual method for semidefinite optimization based on the Nesterov–Todd direction
2001
Interior-point methods for semidefinite optimization have been studied intensively in...
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
1999
A simplified but still quite realistic model of the nuclear reactor fuel management...
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
2000
A simplified but still quite realistic model of the nuclear reactor fuel management...
Method of approximate centers for semi-definite programming
Method of approximate centers for semi-definite programming
1997
The success of interior point algorithms for large-scale linear programming has...
Copositive relaxation for general quadratic programming
Copositive relaxation for general quadratic programming
1998
We consider general, typically nonconvex, Quadratic Programming Problems. The...
Potential reduction algorithms for structured combinatorial optimization problems
Potential reduction algorithms for structured combinatorial optimization problems
1997
Recently Karmarkar proposed a potential reduction algorithm for binary feasibility...
Sensitivity analysis in linear programming: Just be careful!
Sensitivity analysis in linear programming: Just be careful!
1997
In this paper we review the topic of sensitivity analysis in linear programming. We...
A nonconvex weighted potential function for polynomial target following methods
A nonconvex weighted potential function for polynomial target following methods
1998
Long step interior-point methods in linear programming are some of the most efficient...
Logarithmic barrier decomposition methods for semi-infinite programming
Logarithmic barrier decomposition methods for semi-infinite programming
1997
A computational study of some logarithmic barrier decomposition algorithms for...
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
1997
The formulation of interior point algorithms for semidefinite programming has become...
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
1997
In this paper we show that the primal–dual Dikin affine scaling algorithm for...
Optimization of nuclear reactor reloading patterns
Optimization of nuclear reactor reloading patterns
1997
The loading pattern of fuel bundles in a reactor core determines the characteristics...
Primal-dual target-following algorithms for linear programming
Primal-dual target-following algorithms for linear programming
1996
In this paper, the authors propose a method for linear programming with the property...
Achievable potential reductions in the method of Kojima et al. in the case of linear programming
Achievable potential reductions in the method of Kojima et al. in the case of linear programming
1994
Kojima et al proposed a primal-dual interior point method, based on potential...
Inverse barrier methods for linear programming
Inverse barrier methods for linear programming
1994
In the recent interior point methods for linear programming much attention has been...
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
1995
Recently a number of papers were written that present low-complexity interior-point...
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
1995
The literature in the field of interior point methods for Linear Programming has been...
A logarithmic barrier cutting plane method for convex programming
A logarithmic barrier cutting plane method for convex programming
1995
The paper presents a logarithmic barrier cutting plane algorithm for convex (possibly...
Papers per page: