A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs

A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs

10.3934/jimo.2018190

Saved in:

Bibliographic Details
Main Authors:	Dai, Y.-H., Liu, X.-W., Sun, J.
Other Authors:	DECISION SCIENCES
Format:	Article
Published:	American Institute of Mathematical Sciences 2021
Subjects:	Constrained optimization Global and local convergence Infeasibility Interior-point method Nonlinear programming
Online Access:	https://scholarbank.nus.edu.sg/handle/10635/196192
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

Similar Items

A robust primal-dual interior-point algorithm for nonlinear programs
by: Liu, X., et al.
Published: (2013)

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
by: Zhou, G., et al.
Published: (2014)

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
by: Zhou, G., et al.
Published: (2014)

Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
by: Liu, X.W., et al.
Published: (2013)

A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014)

A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
by: Liu, X., et al.
Published: (2013)

Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints
by: Liu, X., et al.
Published: (2013)

Some new search directions for primal-dual interior point methods in semidefinite programming
by: Toh, K.-C.
Published: (2014)

Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
by: Sun, J., et al.
Published: (2013)

A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties
by: Huang, Z.-H., et al.
Published: (2013)

Solving linear programming problems by the interior-point method
by: Sa-at Moungjun
Published: (2009)

Efficient detection and exploitation of infeasible paths for software timing analysis
by: Suhendra, V., et al.
Published: (2013)

Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method
by: Sun, J., et al.
Published: (2013)

Interior proximal point algorithm for linear programs
by: Setiono, R.
Published: (2014)

Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problems
by: Sun, J., et al.
Published: (2013)

Parallel Interior Point Schemes for Solving Multistage Convex Programming
by: Hegland, M., et al.
Published: (2013)

Interior-point methods for minimization of potential energy functions of polypeptides
by: MUTHU SOLAYAPPAN
Published: (2013)

A predictor-corrector algorithm for a class of nonlinear saddle point problems
by: Sun, J., et al.
Published: (2013)

Infeasible potential reduction algorithms for semidefinite programming
by: Zhao, X.-Y., et al.
Published: (2014)

A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems
by: Sun, J., et al.
Published: (2013)

An inexact primal-dual path following algorithm for convex quadratic SDP
by: Toh, K.-C.
Published: (2014)

A note on the calculation of step-lengths in interior-point methods for semidefinite programming
by: Toh, K.-C.
Published: (2014)

Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
by: Chai, J.-S., et al.
Published: (2014)

Interior-point methods with decomposition for solving large-scale linear programs
by: Zhao, G.Y.
Published: (2014)

Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
by: LI LU
Published: (2011)

Mining patterns of unsatisfiable constraints to detect infeasible paths
by: DING, Sun, et al.
Published: (2015)

A T-algebraic approach to primal-dual interior-point algorithms
by: Chua, Chek Beng.
Published: (2009)

The fixed-point set and the convergence set of a continuous function
by: Sompong Chuysurichay
Published: (2008)

Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path
by: Zhao, G.
Published: (2014)

Primal dual algoritma dalam program linear simplex versus interior point
by: , AGUSTAF, Rusdy, et al.
Published: (2002)

An inexact interior point method for L1-regularized sparse covariance selection
by: Li, L., et al.
Published: (2014)

On the log-exponential trajectory of linear programming
by: Sun, J., et al.
Published: (2013)

On the choice of parameters for power-series interior point algorithms in linear programming
by: Zhao, G.
Published: (2014)

Minimalist Space: The Influence of Interior Design on the Mental Health of Teenagers
by: Datinguinoo, Zhyrine Ann Nicole K.
Published: (2022)

A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
by: Zhao, G.
Published: (2014)

Interior dual proximal point algorithm for linear programs
by: Setiono, R.
Published: (2014)

Remarks on the shooting method for nonlinear two-point boundary-value problems
by: Nguyen, Trung Hieu
Published: (2017)

Solutions of n-point boundary value problems associated with nonlinear summary difference equations
by: Sheng, Q., et al.
Published: (2014)

Stability regions for constrained nonlinear systems and their functional characterization via support-vector-machine learning
by: Ong, C.J., et al.
Published: (2014)

A trust region algorithm for minimization of locally Lipschitzian functions
by: Qi, L., et al.
Published: (2013)