An adaptive-step primal-dual interior point algorithm for linear optimization
DOI10.1016/J.NA.2009.05.021zbMATH Open1239.90072OpenAlexW2077264651MaRDI QIDQ425813FDOQ425813
Authors: Min Kyung Kim, Yong-Hoon Lee, Gyeong-Mi Cho 
Publication date: 9 June 2012
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.05.021
Recommendations
- An adaptive long step interior point algorithm for linear optimization
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
- An eligible primal-dual interior-point method for linear optimization
kernel functionpolynomial algorithmlinear optimization problemprimal-dual interior point methodadaptive-steplarge-updateworst-case complexity
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primal-dual target-following algorithms for linear programming
- A dynamic large-update primal‐dual interior-point method for linear optimization
- A self-adjusting primal–dual interior point method for linear programs
- An adaptive self-regular proximity-based large-update IPM for LO
Cited In (6)
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
- Title not available (Why is that?)
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
- An adaptive long step interior point algorithm for linear optimization
This page was built for publication: An adaptive-step primal-dual interior point algorithm for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425813)
