An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635): Difference between revisions

@@ Property / cites work @@
+Limiting behavior of the affine scaling continuous trajectories for linear programming problems
+Normal rank
@@ Property / cites work @@
+Q3539529
@@ Property / cites work: Q3539529 / rank @@
+Normal rank
@@ Property / cites work @@
+The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Complexity of a noninterior path-following method for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A Global and Local Superlinear Continuation-Smoothing Method for<i>P</i><sub>0</sub>and<i>R</i><sub>0</sub>NCP or Monotone NCP
+Normal rank
@@ Property / cites work @@
+A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
+Normal rank
@@ Property / cites work @@
+A Non-Interior-Point Continuation Method for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
+Normal rank
@@ Property / cites work @@
+Non-interior continuation methods for solving semidefinite complementarity problems
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
+Normal rank
@@ Property / cites work @@
+On the classical logarithmic barrier function method for a class of smooth convex programming problems
+Normal rank
@@ Property / cites work @@
+Q5583564
@@ Property / cites work: Q5583564 / rank @@
+Normal rank
@@ Property / cites work @@
+On well definedness of the central path
@@ Property / cites work: On well definedness of the central path / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Penalty/barrier path-following in linearly constrained optimization
+Normal rank
@@ Property / cites work @@
+Some Noninterior Continuation Methods for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Homotopy Continuation Methods for Nonlinear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+On some efficient interior point methods for nonlinear convex programming
+Normal rank
@@ Property / cites work @@
+A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
+Normal rank
@@ Property / cites work @@
+On controlling the parameter in the logarithmic barrier term for convex programming problems
+Normal rank
@@ Property / cites work @@
+A study of the dual affine scaling continuous trajectories for linear programming
+Normal rank
@@ Property / cites work @@
+An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
+Normal rank
@@ Property / cites work @@
+Q4206561
@@ Property / cites work: Q4206561 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+Q5202851
@@ Property / cites work: Q5202851 / rank @@
+Normal rank
@@ Property / cites work @@
+A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
+Normal rank
@@ Property / cites work @@
+On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+A globally convergent primal-dual interior point algorithm for convex programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
+Normal rank
@@ Property / cites work @@
+A simplified global convergence proof of the affine scaling algorithm
+Normal rank
@@ Property / cites work @@
+On the existence and convergence of the central path for convex programming and some duality results
+Normal rank
@@ Property / cites work @@
+Interior-point Lagrangian decomposition method for separable convex optimization
+Normal rank
@@ Property / cites work @@
+A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
+Normal rank
@@ Property / cites work @@
+Improving  the convergence  of non-interior point algorithms  for nonlinear complementarity problems
+Normal rank
@@ Property / cites work @@
+Analysis of some interior point continuous trajectories for convex programming
+Normal rank
@@ Property / cites work @@
+A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
+Normal rank
@@ Property / cites work @@
+The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
+Normal rank
@@ Property / cites work @@
+A generalized interior-point barrier function approach for smooth convex programming with linear constraints
+Normal rank
@@ Property / cites work @@
+A combination of potential reduction steps and steepest descent steps for solving convex programming problems
+Normal rank
@@ Property / cites work @@
+A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
+Normal rank
@@ Property / cites work @@
+On the complexity of following the central path of linear programs by linear extrapolation. II
+Normal rank
@@ Property / cites work @@
+A convergence analysis for a convex version of Dikin's algorithm
+Normal rank
@@ Property / cites work @@
+A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
+Normal rank
@@ Property / cites work @@
+A Centered Projective Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+On the convergence of the affine-scaling algorithm
+Normal rank
@@ Property / cites work @@
+On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
+Normal rank
@@ Property / cites work @@
+A duality theorem for non-linear programming
@@ Property / cites work: A duality theorem for non-linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) potential reduction algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
+Normal rank
@@ Property / cites work @@
+A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A path following algorithm for a class of convex programming problems
+Normal rank