A feasible interior-point algorithm for nonconvex nonlinear programming
type: Item
instance of: scholarly article
title: A feasible interior-point algorithm for nonconvex nonlinear programming
zbMATH Open document ID: 1069.65066
published in: Applied Mathematics and Computation
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 2165291
zbMATH Keywords: Nonlinear programming
zbMATH Keywords: Interior-point method
zbMATH Keywords: Global convergence
zbMATH Keywords: Algorithm
author: Zhibin Zhu
describes a project that uses: TRICE
MaRDI profile type: Publication
full work available at URL: j.amc.2003.10.059
OpenAlex ID: W2104467317
cites work: Q3277015
cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
cites work: On the rate of convergence of certain methods of centers
cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems
cites work: A new polynomial-time algorithm for linear programming
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
cites work: The Projective SUMT Method for Convex Programming
cites work: Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
cites work: An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: Test examples for nonlinear programming codes
cites work: A computationally efficient feasible sequential quadratic programming algorithm
DOI: 10.1016/J.AMC.2003.10.059
description: scientific article; zbMATH DE number 2165291