A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
type: Item
instance of: scholarly article
title: A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
zbMATH Open document ID: 1254.90230
author: Guodong Ma
author: Jinbao Jian
author: Chuanhao Guo
published in: Journal of Systems Science and Complexity
publication date: 2011-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5973932
zbMATH Keywords: \(\varepsilon \)-generalized projection
zbMATH Keywords: global and strong convergence
zbMATH Keywords: inequality constraints
zbMATH Keywords: method of strongly sub-feasible directions
zbMATH Keywords: optimization
describes a project that uses: CUTEr
describes a project that uses: CUTE
MaRDI profile type: Publication
full work available at URL: s11424-011-8105-5
OpenAlex ID: W2020125359
cites work: Q3277015
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
cites work: Rate of Convergence of a Class of Methods of Feasible Directions
cites work: Q4870434
cites work: Q3680625
cites work: Q3039052
cites work: Combined phase I—phase II methods of feasible directions
cites work: Q4950903
cites work: Q3022999
cites work: A finitely convergent algorithm for convex inequalities
cites work: A new finitely convergent algorithm for systems of nonlinear inequalities
cites work: Methods for finding feasible points in constrained optimization
cites work: Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems
cites work: Test examples for nonlinear programming codes
cites work: CUTE
DOI: 10.1007/S11424-011-8105-5
description: scientific article; zbMATH DE number 5973932