scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

ellipsoids saddle points central point results bounded, convex polyhedron convex concave, smooth linear smooth, convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Methods of successive quadratic programming type (90C55) Polytopes and polyhedra (52Bxx)

Related Items

Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, Optimal ellipsoidal approximations around the analytic center, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, An interior point approach for linear complementarity problem using new parametrized kernel function, An interior-point method for multifractional programs with convex constraints, Probing a set of hyperplanes by lines and related problems, A combined homotopy interior point method for general nonlinear programming problems, A finite termination Mehrotra-type predictor-corrector algorithm, An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope, An adaptive self-regular proximity-based large-update IPM for LO, A polynomial-time algorithm, based on Newton's method, for linear programming, Polynomial time second order mehrotra-type predictor--corrector algorithms, A combined homotopy interior point method for convex nonlinear programming, An interior-point method for semi-infinite programming problems, New complexity results for the Iri-Imai method, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A corrector-predictor interior-point method with new search direction for linear optimization, Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis, Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, On some efficient interior point methods for nonlinear convex programming, Karmarkar's linear programming algorithm and Newton's method, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, Ragnar Frisch and interior-point methods, Using central prices in the decomposition of linear programs, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, A polynomial path following algorithm for convex programming, An easy way to teach interior-point methods., The asymptotic optimal partition and extensions of the nonsubstitution theorem, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, Computation of the distance to semi-algebraic sets, An interior-point algorithm for linear optimization based on a new barrier function, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, An efficient parameterized logarithmic kernel function for linear optimization, New method for determining search directions for interior-point algorithms in linear optimization, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, A redundant Klee-Minty construction with all the redundant constraints touching the feasible region, Method of centers for minimizing generalized eigenvalues, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, An efficient twice parameterized trigonometric kernel function for linear optimization, Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits, An ADMM-based interior-point method for large-scale linear programming, Ten years of feasibility pump, and counting, Probing the arrangement of hyperplanes, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Analytic centers and repelling inequalities, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, Pivot versus interior point methods: Pros and cons, The relation between the path of centers and Smale's regularization of the linear programming problem, Approximate cone factorizations and lifts of polytopes, An interior method for nonconvex semidefinite programs