An entire space polynomial-time algorithm for linear programming (Q2442633): Difference between revisions

@@ Property / author @@
-Da-Gang Tian
@@ Property / author: Da-Gang Tian / rank @@
-Normal rank
@@ Property / author @@
+Da-Gang Tian
@@ Property / author: Da-Gang Tian / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-013-0048-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2037428873
@@ Property / OpenAlex ID: W2037428873 / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A deep cut ellipsoid algorithm for convex programming: Theory and applications
+Normal rank
@@ Property / cites work @@
+Q4856863
@@ Property / cites work: Q4856863 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal and dual convergence of a proximal point exponential penalty method for linear programming
+Normal rank
@@ Property / cites work @@
+On the entropic perturbation and exponential penalty methods for linear programming
+Normal rank
@@ Property / cites work @@
+Modified barrier functions (theory and methods)
@@ Property / cites work: Modified barrier functions (theory and methods) / rank @@
+Normal rank
@@ Property / cites work @@
+Numerical experiments with an interior-exterior point method for nonlinear programming
+Normal rank
@@ Property / cites work @@
+On the convergence of the exponential multiplier method for convex programming
+Normal rank
@@ Property / cites work @@
+Nonlinear rescaling and proximal-like methods in convex optimization
+Normal rank
@@ Property / cites work @@
+Nonlinear rescaling vs. smoothing technique in convex optimization
+Normal rank
@@ Property / cites work @@
+A Primal-Dual Exterior Point Method for Nonlinear Optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual nonlinear rescaling method for convex optimization
+Normal rank
@@ Property / cites work @@
+Primal–dual exterior point method for convex optimization
+Normal rank
@@ Property / cites work @@
+.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual nonlinear rescaling method with dynamic scaling parameter update
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A Mathematical View of Interior-Point Methods in Convex Optimization
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+The interior-point revolution in optimization: History, recent developments, and lasting consequences
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Self-concordant functions for optimization on smooth manifolds
+Normal rank
@@ Property / cites work @@
+Q3655929
@@ Property / cites work: Q3655929 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive construction of optimal self-concordant barriers for homogeneous cones
+Normal rank
@@ Property / cites work @@
+Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+The complexity of self-regular proximity based infeasible IPMs
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps
+Normal rank
@@ Property / cites work @@
+A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs
+Normal rank
@@ Property / cites work @@
+A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Complexity of a noninterior path-following method for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+New self-concordant barrier for the hypercube
@@ Property / cites work: New self-concordant barrier for the hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q5385318
@@ Property / cites work: Q5385318 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Khachiyan’s algorithm for linear programming
@@ Property / cites work: Khachiyan’s algorithm for linear programming / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2442633