A generalization of the norm-relaxed method of feasible directions
type: Item
instance of: scholarly article
title: A generalization of the norm-relaxed method of feasible directions
zbMATH Open document ID: 0935.65064
DOI: 10.1016/S0096-3003(98)10025-5
author: Xibin Chen
author: Michael M. Kostreva
published in: Applied Mathematics and Computation
publication date: 2000-04-24T00:00:00Z
review text: The paper deals with the method of feasible directions where an ellipsoidal norm term is added in the objective function of the feasible direction search program.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1311036
zbMATH Keywords: nonlinear programming
zbMATH Keywords: method of feasible directions
zbMATH Keywords: global convergence
reviewed by: Johannes Terno
MaRDI profile type: Publication
cites work: Q4721081
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: Rate of Convergence of a Class of Methods of Feasible Directions
cites work: On the Pironneau-Polak method of centers
cites work: On the rate of convergence of some feasible direction algorithms
cites work: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
cites work: Combined phase I—phase II methods of feasible directions
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems
cites work: Convergence analysis of norm-relaxed method of feasible directions
cites work: Self-tuning norm-relaxed method of feasible directions
cites work: Generalization of Murty's direct algorithm to linear and convex quadratic programming
cites work: Q3134873
cites work: Test examples for nonlinear programming codes
cites work: More test examples for nonlinear programming codes
full work available at URL: s0096-3003(98)10025-5
OpenAlex ID: W2031807043
Recommended article: Norm-relaxed method of feasible directions for solving nonlinear programming problems
Recommended article: A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
Recommended article: Convergence analysis of norm-relaxed method of feasible directions
Recommended article: A feasible directions method for nonsmooth convex optimization
Recommended article: Q3783851
Recommended article: The regularized feasible directions method for nonconvex optimization
Recommended article: Self-tuning norm-relaxed method of feasible directions
Recommended article: Q4707328
Recommended article: Q4013994
Recommended article: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
description: scientific article; zbMATH DE number 1311036