Analytic centers and repelling inequalities

DOI10.1016/S0377-2217(02)00326-0zbMath1058.90075MaRDI QIDQ1848382

Richard J. Caron, Harvey J. Greenberg, Allen G. Holder

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Interior point methodsLinear programmingSensitivity analysisComputational economicsStrict complementarityAnalytic centerCentral pathPolyhedral theory

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

Analytic center cutting plane methods for variational inequalities over convex bodies, Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem, An homage to Joseph-Louis Lagrange and Pierre Huard, Interior point methods in DEA to determine non-zero multiplier weights, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Unifying optimal partition approach to sensitivity analysis in conic optimization, Partitioning multiple objective optimal solutions with applications in radiotherapy design

Cites Work

• Convergence behavior of interior-point algorithms
• A new polynomial-time algorithm for linear programming
• Applications of the notion of analytic center in approximation (estimation) problems
• Note on prime representations of convex polyhedral sets
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Minimal representation of convex polyhedral sets
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• A multiobjective interior primal-dual linear programming algorithm
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• Consistency, redundancy, and implied equalities in linear systems
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Path-Following Methods for Linear Programming
• A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
• Marginal And Parametric Analysis Of The Central Optimal Solution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item