Monteiro R.D.C.

R.D.C. Monteiro

Information about the author R.D.C. Monteiro will soon be added to the site.
Found 14 papers in total
First- and second-order methods for semidefinite programming
First- and second-order methods for semidefinite programming
2003
In this paper, we survey the most recent methods that have been developed for the...
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
2003
The authors of this paper recently introduced a transformation that converts a class...
On dual convergence of the generalized proximal point method with Bregman distances
On dual convergence of the generalized proximal point method with Bregman distances
2000
The use of generalized distances (e.g., Bregman distances), instead of the Euclidean...
Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem
Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem
1996
Given a certain monotone horizontal linear complementarity problem (HLCP), we can...
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
2003
In this paper, we present a nonlinear programming algorithm for solving semidefinite...
Properties of an interior-point mapping for mixed complementarity problems
Properties of an interior-point mapping for mixed complementarity problems
1996
Using a unified theory of local homeomorphic maps, we establish some basic properties...
On two interior-point mappings for nonlinear semidefinite complementarity problems
On two interior-point mappings for nonlinear semidefinite complementarity problems
1998
Extending our previous work, this paper studies properties of two fundamental mappings...
Maximum stable set formulations and heuristics based on continuous optimization
Maximum stable set formulations and heuristics based on continuous optimization
2002
The stability number α (G) for a given graph G is the size of a maximum stable...
Solving a class of semidefinite programs via nonlinear programming
Solving a class of semidefinite programs via nonlinear programming
2002
In this paper, we introduce a transformation that converts a class of linear and...
Polynomial convergence of primal–dual algorithms for the second-order cone program based on the Monteiro–Zhang family of directions
Polynomial convergence of primal–dual algorithms for the second-order cone program based on the Monteiro–Zhang family of directions
2000
In this paper we study primal–dual path-following algorithms for the...
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...
Polynomiality of primal–dual algorithms for semidefinite linear complementarity problems based on the Kojima–Shindoh–Hara family of directions
Polynomiality of primal–dual algorithms for semidefinite linear complementarity problems based on the Kojima–Shindoh–Hara family of directions
1999
Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite...
Superlinear primal-dual affine scaling algorithms for LCP
Superlinear primal-dual affine scaling algorithms for LCP
1995
The authors describe an interior-point algorithm for monotone liner complementarity...
A simplified global convergence proof of the affine scaling algorithm
A simplified global convergence proof of the affine scaling algorithm
1993
This paper presents a simplified and self-contained global convergence proof for the...
Papers per page: