A Predictor--Corrector Method for Solving the (2007)
Matrix Lcp From, Florian A. Potra, Rongqin Sheng
A predictor-corrector method for solving the P ()-matrix linear complementarity problems from infeasible starting points is analyzed. Two matrix factorizations and two backsolves are performed at...
Advanced Computational Techniques for Laue Diffraction Analysis (1999)
Zhong Ren, Rongqin Sheng, Stephen J. Wright
We describe LaueView, a code for processing the measured intensity data in Laue X-ray diffraction experiments to obtain corrected structure amplitudes for each reflection that take account of the...
Advanced Computational Techniques for Laue Diffraction (1999)
Analysis Zhong Ren, Zhong Ren, Rongqin Sheng, Stephen J. Wright
We describe LaueView, a code for processing the measured intensity data in Laue X-ray diffraction experiments to obtain corrected structure amplitudes for each reflection that take account of the...
OPTIMIZATION TECHNOLOGY CENTER PCx User Guide: Supplement for PCxGUI1 (1998)
ABSTRACT We describe the installation and use of a graphical interface for PCx, the primal-dual interiorpoint code for linear programming. The interface is coded in Java and is therefore...
Interior-point methods for semidefinite programming / (1997)
Typescript (photocopy).
On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming (1997)
Jun Ji, Florian A. Potra, Rongqin Sheng
We study the local convergence of a predictor-corrector algorithm for semidefinite programming problems based on the Monteiro-Zhang unified direction whose polynomial convergence was recently...
Nonsymmetric Search Directions for Semidefinite Programming (1997)
Rongqin Sheng, Florian A. Potra
Two nonsymmetric search directions for semidefinite programming, the XZ and ZX search directions, are proposed. They are derived from a nonsymmetric formulation of the semidefinite programming...
A Large-Step Infeasible-Interior-Point Method For The P * -Matrix LCP (1997)
Florian A. Potra, Rongqin Sheng
. A large-step infeasible-interior-point method is proposed for solving P# (#)-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large...
Florian Potra, Rongqin Sheng, Nathan Brixius
Merhotra type primal-dual predictor-corrector interior-point algorithms for semidefinite programming are implemented by using the homogeneous formulation proposed and analyzed by Potra and Sheng....
Rongqin Sheng, Florian A. Potra, Jun Ji
We propose a unified analysis for a class of infeasible-start predictor-corrector algorithms for semidefinite programming problems, using the Monteiro-Zhang unified direction. The algorithms are...
Solving Semidefinite Programs in Mathematica (1996)
Nathan Brixius, Florian A. Potra, Rongqin Sheng
Interior-point algorithms for solving semidefinite programs are described and implemented in Mathematica. Included are Mizuno-Todd-Ye type predictor-corrector algorithms and Mehrotra type...
Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming (1996)
Florian A. Potra, Rongqin Sheng
We prove the superlinear convergence of the primal-dual infeasible-interior-point path-following algorithm proposed recently by Kojima, Shida and Shindoh and the present authors, under two...
A Path Following Method for LCP with Superlinearly Convergent Iteration Sequence (1996)
Florian A. Potra, Rongqin Sheng
A new algorithm for solving linear complementarity problems with sufficient matrices is proposed. If the problem has a solution the algorithm is superlinearly convergent from any positive starting...
Florian A. Potra, Rongqin Sheng
An infeasible start predictor-corrector algorithm for semidefinite programming is proposed. It is a direct extension of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming. The...
Florian A. Potra, Rongqin Sheng
Abstract. A primal-dual infeasible-interior-point path-following algorithm is proposed for solving semidefinite programming (SDP) problems. If the problem has a solution, then the algorithm is...
A Superlinearly Convergent Infeasible-interior-point Algorithm for Degenerate LCP (1995)
Florian Potra Rongqin, Florian A. Potra, Rongqin Sheng
A large-step infeasible path-following method is proposed for solving general linear complementarity problems with sufficient matrices. If the problem has a solution the algorithm is superlinearly...
A Path Following Method for LCP with Superlinearly Convergent Iteration Sequence (1995)
Florian A. Potra, Rongqin Sheng
A new algorithm for solving linear complementarity problems with sufficient matrices is proposed. If the problem has a solution the algorithm is superlinearly convergent from any positive starting...
Homogeneous Interior-Point Algorithms for Semidefinite Programming (1995)
Florian A. Potra, Rongqin Sheng
A simple homogeneous primal-dual feasibility model is proposed for semidefinite programming (SDP) problems. Two infeasible-interior-point algorithms are applied to the homogeneous formulation. The...
A Superlinearly Convergent Infeasible-interior-point Algorithm for Degenerate LCP (1995)
Florian A. Potra, Rongqin Sheng
A large-step infeasible path-following method is proposed for solving general linear complementarity problems with sufficient matrices. If the problem has a solution the algorithm is superlinearly...
Florian A. Potra, Rongqin Sheng
We propose a primal-dual infeasible-interior-point path-following algorithm for solving semidefinite programming (SDP) problems. If the problem has a solution, then the algorithm is globally...
An infeasible-interior-point method for the P -matrix LCP (1994)
Florian A. Potra, Rongqin Sheng
A large-step infeasible-interior-point method is proposed for solving P ()-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large...
Florian A. Potra, Rongqin Sheng
A new predictor-corrector algorithm is proposed for solving P ()-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting...
A Large-step Infeasible-interior-point Method for the P * -matrix LCP (1994)
Florian A. Potra, Rongqin Sheng
A large-step infeasible-interior-point method is proposed for solving P ()-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large...
A Predictor-Corrector Method for Solving the P*-matrix LCP from Infeasible Starting Points (1994)
Jun Ji, Florian A. Potra, Rongqin Sheng
A predictor-corrector method for solving the P ()-matrix linear complementarity problems from infeasible starting points is analyzed. Two matrix factorizations and two backsolves are performed at...
A modified O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence (1994)
Florian A. Potra, Rongqin Sheng
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity problems from infeasible starting points. The algorithm terminates in O(nL) steps either by finding a...