A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
10.3934/jimo.2018190
Saved in:
Main Authors: | Dai, Y.-H., Liu, X.-W., Sun, J. |
---|---|
其他作者: | DECISION SCIENCES |
格式: | Article |
出版: |
American Institute of Mathematical Sciences
2021
|
主題: | |
在線閱讀: | https://scholarbank.nus.edu.sg/handle/10635/196192 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
A robust primal-dual interior-point algorithm for nonlinear programs
由: Liu, X., et al.
出版: (2013) -
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
由: Zhou, G., et al.
出版: (2014) -
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
由: Zhou, G., et al.
出版: (2014) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
由: Li, L., et al.
出版: (2014) -
Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
由: Liu, X.W., et al.
出版: (2013)