Publication:3738934
From MaRDI portal
zbMath0602.90106MaRDI QIDQ3738934
Publication date: 1986
ellipsoids; saddle points; central point; results; bounded, convex polyhedron; convex concave, smooth; linear smooth, convex programming
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C05: Linear programming
90C55: Methods of successive quadratic programming type
52Bxx: Polytopes and polyhedra
Related Items
Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Computation of the distance to semi-algebraic sets, An adaptive self-regular proximity-based large-update IPM for LO, An easy way to teach interior-point methods., Using central prices in the decomposition of linear programs, The relation between the path of centers and Smale's regularization of the linear programming problem, Polynomial time second order mehrotra-type predictor--corrector algorithms, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope, A polynomial-time algorithm, based on Newton's method, for linear programming, On some efficient interior point methods for nonlinear convex programming, Karmarkar's linear programming algorithm and Newton's method, Method of centers for minimizing generalized eigenvalues, Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Optimal ellipsoidal approximations around the analytic center, A combined homotopy interior point method for general nonlinear programming problems, A combined homotopy interior point method for convex nonlinear programming, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, Pivot versus interior point methods: Pros and cons, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Probing the arrangement of hyperplanes, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Analytic centers and repelling inequalities, An interior method for nonconvex semidefinite programs, An interior-point method for multifractional programs with convex constraints, An interior-point method for semi-infinite programming problems, New complexity results for the Iri-Imai method, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, A finite termination Mehrotra-type predictor-corrector algorithm, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, A polynomial path following algorithm for convex programming, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
