scientific article; zbMATH DE number 1017028

zbMath0954.65041MaRDI QIDQ4339096

Tamás Terlaky, Jean-Philippe Vial, Kees Roos

Publication date: 4 June 1997

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

zbMATH Keywords

complexityconvergencelinear programmingtextbookasymptotic behaviourinterior point methodslinear optimizationKarmarkar's projective methodlogarithmic barrier approachtarget following approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)

Related Items

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, An efficient fifth-order method for linear optimization, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, Infeasible interior-point methods for linear optimization based on large neighborhood, A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function, A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization, A logarithmic barrier approach for linear programming, Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, Interior-point methods: An old and new approach to nonlinear programming, Polynomial time second order mehrotra-type predictor--corrector algorithms, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, Warm start by Hopfield neural networks for interior point methods, On the enrouting protocol problem under uncertainty, Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, Strictly feasible solutions and strict complementarity in multiple objective linear optimization, A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier, A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A full-Newton step interior-point algorithm based on modified Newton direction, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, Preemptive scheduling in overloaded systems., A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions, A new class of copulas involved geometric distribution: estimation and applications, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Hopfield neural networks in large-scale linear optimization problems, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, An interior-exterior approach for convex quadratic programming, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, Interrupt timed automata: verification and expressiveness, A predictor-corrector algorithm with multiple corrections for convex quadratic programming, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term, Full-NT step infeasible interior-point method for SOCO based on a specific kernel function, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A study of the dual affine scaling continuous trajectories for linear programming, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, Active constraint set invariancy sensitivity analysis in linear optimization, An infeasible full-NT step interior point algorithm for CQSCO, A new class of theorems of the alternative, Opacity for linear constraint Markov chains, George B. Dantzig and systems optimization, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, New parameterized kernel functions for linear optimization, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, The asymptotic optimal partition and extensions of the nonsubstitution theorem, The sagitta method for solving linear programs, On self-regular IPMs (with comments and rejoinder), Examples of ill-behaved central paths in convex optimization, Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization, An interior-point algorithm for linear optimization based on a new barrier function, A polynomial path-following interior point algorithm for general linear complementarity problems, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, An efficient parameterized logarithmic kernel function for linear optimization, New method for determining search directions for interior-point algorithms in linear optimization, Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, A class of large-update and small-update primal-dual interior-point algorithms for linear optimization, Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO, EP theorem for dual linear complementarity problems, Partitioning multiple objective optimal solutions with applications in radiotherapy design, An efficient twice parameterized trigonometric kernel function for linear optimization, Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions, Approximation of linear programs by Bregman's \(D_F\) projections, A new class of polynomial primal-dual methods for linear and semidefinite optimization, The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, Analytic centers and repelling inequalities, Interior-point methods, Pivot versus interior point methods: Pros and cons, Advances in design and implementation of optimization software, Multiparametric demand transportation problem, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem, Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients, An infeasible full NT-step interior point method for circular optimization, A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, Asymptotic analysis of a path-following barrier method for linearly constrained convex problems^*, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming, An interior point approach for linear complementarity problem using new parametrized kernel function, Hessian distances and their applications in the complexity analysis of interior-point methods, Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming, A corrector–predictor path-following algorithm for semidefinite optimization, An adaptive self-regular proximity-based large-update IPM for LO, On an inverse linear programming problem, A new primal-dual interior-point algorithm for convex quadratic optimization, Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, A logarithmic barrier interior-point method based on majorant functions for second-order cone programming, A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps, A corrector-predictor interior-point method with new search direction for linear optimization, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, A new full-NT step interior-point method for circular cone optimization, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, An infeasible interior-point algorithm with full-Newton step for linear optimization, A sparse proximal implementation of the LP dual active set algorithm, Dual versus primal-dual interior-point methods for linear and conic programming, On the symmetry function of a convex set, Solving two-stage stochastic programming problems with level decomposition, Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming, A generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, An interior point method for linear programming based on a class of Kernel functions, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, A self-adjusting primal–dual interior point method for linear programs, Generation of degenerate linear programming problems, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Dual–primal algorithm for linear optimization, Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind, A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP, A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, A primal‐dual interior-point method for linear optimization based on a new proximity function, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, Unnamed Item, Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function, An efficient parameterized logarithmic kernel function for semidefinite optimization, A smoothing heuristic for a bilevel pricing problem, A unified approach to non-radial graph models in data envelopment analysis: common features, geometry, and duality, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, A mathematical programming model for computing the fries number of a fullerene, Interior-point methods for optimization, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming, Unnamed Item, Interrupt Timed Automata, A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function, A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, A polynomial-time weighted path-following interior-point algorithm for linear optimization, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization, A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions, A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, Unnamed Item, A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem, The central path visits all the vertices of the Klee–Minty cube, Sensitivity analysis in linear optimization: invariant support set intervals, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, Unnamed Item, A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION, Primal-dual interior-point algorithms for convex quadratic circular cone optimization, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, An efficient logarithmic barrier method without line search for convex quadratic programming, A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term, A framework for plasticity‐based topology optimization of continuum structures, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Interior-point algorithm for linear programming based on a new descent direction, Corrector-predictor interior-point method with new search direction for semidefinite optimization, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, Robust multivariate adaptive regression splines under cross-polytope uncertainty: an application in a natural gas market, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, A new search direction for full-Newton step infeasible interior-point method in linear optimization, Unnamed Item, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, Unnamed Item, Unnamed Item, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, An easy way to teach interior-point methods., Two simple proofs for analyticity of the central path in linear programming., An interesting characteristic of phase-1 of dual–primal algorithm for linear programming, Spline regression models for complex multi-modal regulatory networks, SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps, Experiments with a hybrid interior point/combinatorial approach for network flow problems, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, Improved OR education through the use of spreadsheet models, Sensitivity analysis in convex quadratic optimization: invariant support set interval, Unnamed Item, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, Path-following interior-point algorithm for monotone linear complementarity problems