Affine-scaling for linear programs with free variables
From MaRDI portal
Publication:1812553
DOI10.1007/BF01582276zbMath0825.90681OpenAlexW2011934229MaRDI QIDQ1812553
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582276
Related Items
Shape-preserving approximation of multiscale univariate data by cubic \(L_1\) spline fits, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, Shape-preserving univariate cubic and higher-degree \(L_{1}\) splines with function-value-based and multistep minimization principles, Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties, \(L_1C^1\) polynomial spline approximation algorithms for large data sets, A hybrid method for the nonlinear least squares problem with simple bounds, On the convergence of the affine-scaling algorithm, On affine scaling and semi-infinite programming, Prior reduced fill-in in solving equations in interior point algorithms, Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise, The \(\ell_1\) solution of linear inequalities, Computing expectations with continuous \(p\)-boxes: univariate case, On free variables in interior point methods, Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem., Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines, Shape-preserving, first-derivative-based parametric and nonparametric cubic \(L_{1}\) spline curves, Loss and retention of accuracy in affine scaling methods, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, The role of the augmented system in interior point methods, Shape-preserving interpolation of irregular data by bivariate curvature-based cubic \(L_1\) splines in spherical coordinates, LOQO:an interior point code for quadratic programming, Computational experience with a primal-dual interior point method for linear programming, Shape-preserving, multiscale interpolation by univariate curvature-based cubic \(L_{1}\) splines in Cartesian and polar coordinates, On the big \({\mathcal M}\) in the affine scaling algorithm
Cites Work
- A modification of Karmarkar's linear programming algorithm
- An implementation of Karmarkar's algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
