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

asymptotic behaviourcomplexityconvergenceinterior point methodsKarmarkar's projective methodlinear optimizationlinear programminglogarithmic barrier approachtarget following approachtextbook

Mathematics Subject Classification ID

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

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 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
• 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
• EP theorem for dual linear complementarity problems
• Partitioning multiple objective optimal solutions with applications in radiotherapy design
• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
• Interior-point methods: An old and new approach to nonlinear programming
• Preemptive scheduling in overloaded systems.
• Approximation of linear programs by Bregman's \(D_F\) projections
• Interior-point methods
• Pivot versus interior point methods: Pros and cons
• Advances in design and implementation of optimization software
• Multiparametric demand transportation problem
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
• Strictly feasible solutions and strict complementarity in multiple objective linear optimization
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
• A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
• A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• 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 new class of theorems of the alternative
• Opacity for linear constraint Markov chains
• The asymptotic optimal partition and extensions of the nonsubstitution theorem
• On self-regular IPMs (with comments and rejoinder)
• Examples of ill-behaved central paths in convex optimization
• 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
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
• 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
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• A unified approach to non-radial graph models in data envelopment analysis: common features, geometry, and duality
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• 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
• An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
• A full-modified-Newton step O(n) infeasible interior-point method for the special weighted linear complementarity problem
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
• 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
• A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
• 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
• 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 mathematical programming model for computing the fries number of a fullerene
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
• 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
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• On an inverse linear programming problem
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• 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
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• Generation of degenerate linear programming problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
• A smoothing heuristic for a bilevel pricing problem
• A predictor-corrector algorithm for linear optimization based on a modified Newton direction
• Sensitivity analysis in linear optimization: invariant support set intervals
• Large-update interior point algorithm for P_*-linear complementarity problem
• 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
• An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
• The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*
• A mathematical view of interior-point methods in convex optimization
• A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
• A modified full-Newton step infeasible interior-point algorithm for linear optimization

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)