A finite procedure for finding a point satisfying a system of inequalities*
作者:
Ubaldo M. García-Palomares,
期刊:
Optimization Methods and Software
(Taylor Available online 1995)
卷期:
Volume 5,
issue 2
页码: 157-171
ISSN:1055-6788
年代: 1995
DOI:10.1080/10556789508805607
出版商: Gordon and Breach Science Publishers
关键词: Feasibility;Inequalities;Armijo-Newton Methods
数据来源: Taylor
摘要:
We describe an Armijo-Newton like procedure that locates a feasible point of a non empty system of nonlinear inequalities (and linear equations) in a finite number of operations. Assuming differentiability and Positive Linearly Independence (PLI) of the gradients of the most violated inequalities, the sequence of iterates converges to the relative interior of the given system. At each iteration a linear feasibility problem with a small number of constraints is solved. Preliminary numerical experiments on small systems are encouraging: Systems of up to 80 inequalities and 40 variables have been solved in fewer than 20 iterations. A Pseudocode and hints on how to choose the parameters involved are given
点击下载:
PDF (518KB)
返 回