The paper presents a new method for solving irregular optimization problems with inequality constraints. Our results are based on the construction of p-regularity theory and on reformulating the inequality constraints as equalities. Namely, by introducing the slack variables of corresponding degree
β¦ LIBER β¦
Inequality-Constrained Stationary-Value Problems
β Scribed by Glen D. Camp
- Book ID
- 123683976
- Publisher
- Institute for Operations Research and the Management Sciences
- Year
- 1955
- Weight
- 155 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0096-3984
- DOI
- 10.2307/166769
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
-factor methods for nonregular inequalit
β
Ewa Szczepanik; Alexey Tretβyakov
π
Article
π
2008
π
Elsevier Science
π
English
β 547 KB
Minimizing and Stationary Sequences of C
β
Chou, Chin-Cheng; Ng, Kung-Fu; Pang, Jong-Shi
π
Article
π
1998
π
Society for Industrial and Applied Mathematics
π
English
β 457 KB
Nonsmooth Constrained Optimization and M
β
Aussel, Didier; Corvellec, Jean-NoΓ«l; Lassonde, Marc
π
Article
π
1999
π
Society for Industrial and Applied Mathematics
π
English
β 387 KB
A computational algorithm for functional
β
L.S. Jennings; K.L. Teo
π
Article
π
1990
π
Elsevier Science
π
English
β 350 KB
On using equality-constraint algorithms
β
J. P. Evans; F. J. Gould
π
Article
π
1972
π
Springer-Verlag
π
English
β 262 KB
FEASIBLE DESCENT CONE METHODS FOR INEQUA
β
J. A. SNYMAN; N. STANDER
π
Article
π
1996
π
John Wiley and Sons
π
English
β 784 KB
A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region