A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
type: Item
instance of: scholarly article
title: A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
zbMATH Open document ID: 1410.90201
author: Huaqin Pan
author: Chun-Ming Tang
author: Jinbao Jian
author: Jian-Ling Li
published in: Applied Mathematics and Computation
publication date: 2019-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7036731
zbMATH Keywords: inequality constraints
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: strongly sub-feasible method
zbMATH Keywords: quasi interior-point method
zbMATH Keywords: superlinear convergence
describes a project that uses: CUTEr
describes a project that uses: SifDec
MaRDI profile type: Publication
full work available at URL: j.amc.2015.05.091
OpenAlex ID: W578745989
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
cites work: An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
cites work: A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
cites work: A computationally efficient feasible sequential quadratic programming algorithm
cites work: New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
cites work: Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
cites work: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
cites work: A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
cites work: A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
cites work: On the Accurate Identification of Active Constraints
cites work: A Feasible Active Set QP-Free Method for Nonlinear Programming
cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
cites work: A QP-free constrained Newton-type method for variational inequality problems
cites work: CUTEr and SifDec
DOI: 10.1016/J.AMC.2015.05.091
description: scientific article; zbMATH DE number 7036731