An OnL -iteration homogeneous and self-dual linear programming algorithm
Mathematics of Operations Research
Linear programming, complexity theory and elementary functional analysis
Mathematical Programming: Series A and B
Self-scaled barriers and interior-point methods for convex programming
Mathematics of Operations Research
On the complexity of linear programming under finite precision arithmetic
Mathematical Programming: Series A and B
A mathematical view of interior-point methods in convex optimization
A mathematical view of interior-point methods in convex optimization
Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
Mathematics of Operations Research
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Primal-Dual Interior-Point Methods for Self-Scaled Cones
SIAM Journal on Optimization
A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
SIAM Journal on Optimization
Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
SIAM Journal on Optimization
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
SIAM Journal on Optimization
Complexity of convex optimization using geometry-based measures and a reference point
Mathematical Programming: Series A and B
Solving linear programs with finite precision: II. algorithms
Journal of Complexity
Condition numbers for polyhedra with real number data
Operations Research Letters
| Hi-index | 0.00 |
We address the feasibility (existence of non-trivial solutions) of the pair of alternative conic systems of constraintsAx=0,x@?Cand-A^Ty@?C^*,where A@?R^m^x^n,m