An entire space polynomial-time algorithm for linear programming
From MaRDI portal
Publication:2442633
DOI10.1007/S10898-013-0048-ZzbMATH Open1318.90049OpenAlexW2037428873MaRDI QIDQ2442633FDOQ2442633
Authors: Da-Gang Tian 
Publication date: 1 April 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0048-z
Recommendations
Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Convex Analysis
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Khachiyan’s algorithm for linear programming
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- On the convergence of the exponential multiplier method for convex programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- The ellipsoid method and its consequences in combinatorial optimization
- Modified barrier functions (theory and methods)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- A mathematical view of interior-point methods in convex optimization
- Title not available (Why is that?)
- A primal-dual infeasible-interior-point algorithm for linear programming
- Primal-dual nonlinear rescaling method for convex optimization
- On the entropic perturbation and exponential penalty methods for linear programming
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- Primal and dual convergence of a proximal point exponential penalty method for linear programming
- Nonlinear rescaling and proximal-like methods in convex optimization
- New self-concordant barrier for the hypercube
- Blaschke addition and convex polyhedra
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- A Primal-Dual Exterior Point Method for Nonlinear Optimization
- Numerical experiments with an interior-exterior point method for nonlinear programming
- Complexity of a noninterior path-following method for the linear complementarity problem
- Recursive construction of optimal self-concordant barriers for homogeneous cones
- Primal–dual exterior point method for convex optimization
- Title not available (Why is that?)
- The complexity of self-regular proximity based infeasible IPMs
- A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
- Self-concordant functions for optimization on smooth manifolds
- 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
- A class of self-concordant functions on Riemannian manifolds
Cited In (6)
- A linear space algorithm for the LCS problem
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- The Null Space Problem II. Algorithms
- Solving tall dense linear programs in nearly linear time
- An exterior point polynomial-time algorithm for convex quadratic programming
This page was built for publication: An entire space polynomial-time algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442633)
