On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
DOI10.1007/BF01580602zbMATH Open0804.90087OpenAlexW1991534386MaRDI QIDQ688920FDOQ688920
Authors: Jean-Louis Goffin, Jean-Philippe Vial 
Publication date: 1 November 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580602
Recommendations
- A Centered Projective Algorithm for Linear Programming
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- A scaling technique for finding the weighted analytic center of a polytope
- Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
convergence analysisdual ellipsoidsprimal projective algorithmweighted analytic centerweighted Karmarkar potential function
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Title not available (Why is that?)
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- Karmarkar's algorithm and the ellipsoid method
- Containing and shrinking ellipsoids in the path-following algorithm
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- On the convexity of the multiplicative version of Karmarkar's potential function
- New trajectory-following polynomial-time algorithm for linear programming problems
- Cutting planes and column generation techniques with the projective algorithm
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
Cited In (17)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Using central prices in the decomposition of linear programs
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- A weighted projection centering method
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators
- Primal-dual target-following algorithms for linear programming
- A scaling technique for finding the weighted analytic center of a polytope
- A cutting plane method from analytic centers for stochastic programming
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- An interior point cutting plane heuristic for mixed integer programming
- Learning lyapunov functions for hybrid systems
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A \(J\)-symmetric quasi-Newton method for minimax problems
- A path-following cutting plane method for some monotone variational inequalities∗
- A cutting-plane method to nonsmooth multiobjective optimization problems
Uses Software
This page was built for publication: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688920)
