On the convergence of an infeasible primal-dual interior-point method for convex programming-Reference-Cited by-同舟云学术

On the convergence of an infeasible primal-dual interior-point method for convex programming

Published:1994-01 Issue:4 Volume:3 Page:273-283
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Anstreicher Kurt M.,Vial Jean-Philippe

Publisher

Informa UK Limited

Subject

Applied Mathematics,Control and Optimization,Software

Link

http://www.tandfonline.com/doi/pdf/10.1080/10556789408805570

Reference18 articles.

1. Anstreicher, K.M. 1990. “On long step path following and SUMT for linear and quadratic programming”. Iowa City, IA: Dept. of Management Sciences, University of Iowa.

2. On the classical logarithmic barrier function method for a class of smooth convex programming problems

3. An effective algorithm for minimization

4. Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Comparison of barrier update strategies for interior point algorithms in single-crystal plasticity;Archive of Applied Mechanics;2024-08-14

2. A Symmetric Algorithm for Solving Mechanical Contact Problems Using FreeFEM;Advances in Computational Methods and Technologies in Aeronautics and Industry;2022

3. A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization;Mathematical Programming;2021-03-09

4. A novel algorithm for rate independent small strain crystal plasticity based on the infeasible primal-dual interior point method;International Journal of Plasticity;2020-01

5. Portfolio optimization with entropic value-at-risk;European Journal of Operational Research;2019-11