Monteiro Renato D.C.

Renato D.C. Monteiro

Information about the author Renato D.C. Monteiro will soon be added to the site.
Found 15 papers in total
A geometric view of parametric linear programming
A geometric view of parametric linear programming
1992
We present a new definition of optimality intervals for the parametric right-hand side...
Trust region affine scaling algorithms for linearly constrained convex and concave programs
Trust region affine scaling algorithms for linearly constrained convex and concave programs
1998
We study a trust region affine scaling algorithm for solving the linearly constrained...
A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming
A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming
1998
We present a unified analysis for a class of long-step primal–dual...
On the existence and convergence of the central path for convex programming and some duality results
On the existence and convergence of the central path for convex programming and some duality results
1998
This paper gives several equivalent conditions which guarantee the existence of the...
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
1997
This note establishes a new sufficient condition for the existence and uniqueness of...
Nondegeneracy of polyhedra and linear programs
Nondegeneracy of polyhedra and linear programs
1997
This paper deals with nondegeneracy of polyhedra and linear programming (LP) problems....
On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
1997
This note derives bounds on the length of the primal–dual affine scaling...
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
1996
Adler and Monteiro developed a parametric analysis approach that is naturally related...
A globally convergent primal-dual interior point algorithm for convex programming
A globally convergent primal-dual interior point algorithm for convex programming
1994
This paper studies the global convergence of a large class of primal-dual interior...
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
1991
The authors consider the continuous trajectories of the vector field induced by the...
On the continuous trajectories for a potential reduction algorithm for linear programming
On the continuous trajectories for a potential reduction algorithm for linear programming
1992
For a possibly degenerate linear program ( A is an real matrix, and ), whose optimal...
Convergence and boundary behavior of the projective scaling trajectories for linear programming
Convergence and boundary behavior of the projective scaling trajectories for linear programming
1991
The paper analyzes the convergence and boundary behavior of the continuous...
An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence
An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence
1990
The authors describe a primal-dual interior point algorithm for a class of convex...
Interior path following primal-dual algorithms, part I: Linear programming
Interior path following primal-dual algorithms, part I: Linear programming
1989
The authors describe a primal-dual interior point algorithm for linear programming...
Interior path following primal-dual algorithms, part II: Convex quadratic programming
Interior path following primal-dual algorithms, part II: Convex quadratic programming
1989
The authors describe a primal-dual interior point algorithm for convex quadratic...
Papers per page: