scientific article; zbMATH DE number 1017028

MaRDI QIDQ4339096zbMATH OpenFDO

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

Publication date 4 June 1997

zbMATH Keywords

linear programmingconvergenceinterior point methodscomplexityasymptotic behaviourtextbooklinear 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 numerical analysis (65-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Recommendations

• scientific article; zbMATH DE number 5359577
• Linear and nonlinear programming.
• Linear optimization and extensions
• Linear optimization. Model, solution, application.
• Pivot versus interior point methods: Pros and cons
• scientific article; zbMATH DE number 1168999
• Linear optimization
• Linear programming and its application.
• scientific article; zbMATH DE number 2046035
• A mathematical primer on linear optimization

Cited in

(only showing first 100 items - show all)

• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Large-update interior point algorithm for P_*-linear complementarity problem
• Robust multivariate adaptive regression splines under cross-polytope uncertainty: an application in a natural gas market
• Interior-point methods
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• scientific article; zbMATH DE number 6285133 (Why is no real title available?)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
• A predictor-corrector algorithm for linear optimization based on a modified Newton direction
• An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
• Spline regression models for complex multi-modal regulatory networks
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
• An efficient logarithmic barrier method without line search for convex quadratic programming
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• Interrupt timed automata: verification and expressiveness
• A full-Newton step interior-point algorithm based on modified Newton direction
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• A self-adjusting primal–dual interior point method for linear programs
• New parameterized kernel functions for linear optimization
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• Interior point algorithms in linear optimization
• Interior-point algorithm for linear programming based on a new descent direction
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
• The sagitta method for solving linear programs
• A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• Interior-point methods: An old and new approach to nonlinear programming
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• Dual-primal algorithm for linear optimization
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
• A numerical implementation of an interior point methods for linear programming based on a new kernel function
• Two simple proofs for analyticity of the central path in linear programming.
• Path-following interior-point algorithm for monotone linear complementarity problems
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• 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 Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• Hopfield neural networks in large-scale linear optimization problems
• Sensitivity analysis in linear optimization: invariant support set intervals
• An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
• A corrector-predictor path-following algorithm for semidefinite optimization
• Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
• An adaptive self-regular proximity-based large-update IPM for LO
• Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• An interior point method for linear programming based on a class of Kernel functions
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• scientific article; zbMATH DE number 6913928 (Why is no real title available?)
• Generation of degenerate linear programming problems
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
• An interior-exterior approach for convex quadratic programming
• 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
• A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
• An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
• 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
• A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
• Warm start by Hopfield neural networks for interior point methods
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
• Polynomial time second order mehrotra-type predictor--corrector algorithms
• Analytic centers and repelling inequalities
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• Interior-point methods for optimization
• On an inverse linear programming problem
• Multiparametric demand transportation problem
• Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind
• Introducing interior-point methods for introductory operations research courses and/or linear programming courses
• Interior Point Methods for Linear Optimization
• 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 new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
• EP theorem for dual linear complementarity problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339096)