scientific article; zbMATH DE number 4131946
From MaRDI portal
Publication:3033554
zbMATH Open0691.90053MaRDI QIDQ3033554FDOQ3033554
Authors: C. C. Gonzaga 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- Linear Programming in O([n3/ln n]L) Operations
- A simple complexity proof for a polynomial-time linear programming algorithm
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- scientific article; zbMATH DE number 4062817
- A new polynomial-time algorithm for linear programming
Newton-Raphson iterationapproximated Hessian matricespenalty multiplierpolynomial type algorithmspredictor-corrector homotopy algorithmshort-step penalty function
Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Newton-type methods (49M15)
Cited In (32)
- Gradient preserving operator inference: data-driven reduced-order models for equations with gradient structure
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Title not available (Why is that?)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- An active-set strategy in an interior point method for linear programming
- On the finite convergence of interior-point algorithms for linear programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Convergence behavior of interior-point algorithms
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Finding an interior point in the optimal face of linear programs
- A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
- An interior point method, based on rank-1 updates, for linear programming
- A scaling technique for finding the weighted analytic center of a polytope
- PageRank optimization by edge selection
- A globally convergent primal-dual interior point algorithm for convex programming
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
- Long-step strategies in interior-point primal-dual methods
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga
- Exploiting special structure in a primal-dual path-following algorithm
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- A simple complexity proof for a polynomial-time linear programming algorithm
- An entire space polynomial-time algorithm for linear programming
- An exterior point polynomial-time algorithm for convex quadratic programming
- Simultaneous perception-action design via invariant finite belief sets
- On the convergence of the affine-scaling algorithm
- Title not available (Why is that?)
- A quadratically convergent method for linear programming
- Title not available (Why is that?)
- An interior point potential reduction method for constrained equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033554)
