A full-Newton step interior-point algorithm for linear optimization based on a finite barrier

DOI10.1016/J.ORL.2016.09.009zbMATH Open1408.90320OpenAlexW2524900610MaRDI QIDQ1709950FDOQ1709950

Authors: Hongmei Bi, Weiwei Wang, Hongwei Liu 

Publication date: 15 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.09.009

Recommendations

• A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
• An interior-point algorithm for linear optimization based on a new barrier function
• A full-Newton step polynomial-time algorithm based on a local self-concordant barrier function for linear optimization
• A numerical implementation of an interior point methods for linear programming based on a new kernel function
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function

zbMATH Keywords

interior-point methodskernel functionlinear optimizationfull-Newton step

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new and efficient large-update interior-point method for linear optimization
• Title not available (Why is that?)
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• New interior point algorithms in linear programming
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A full-Newton step interior-point algorithm based on modified Newton direction
• A modified infeasible-interior-point algorithm for linear optimization problems
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions

Cited In (5)

• A full-Newton step interior-point method based on a class of specific algebra transformation
• A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function
• A full-Newton step polynomial-time algorithm based on a local self-concordant barrier function for linear optimization

This page was built for publication: A full-Newton step interior-point algorithm for linear optimization based on a finite barrier

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