Abstract
In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the ɛ-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new ɛ-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.
Similar content being viewed by others
References
G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam, 1960.
J. B. Rosen, The gradient projection method for nonlinear programming, part I, linear constraints, SIAM J. Appl. Math., 1960, 8(1): 181–217.
D. M. Topkis and A. F. Veinott, On the convergence of some feasible direction algorithms for nonlinear programming, SIAM J. Control, 1967, 5(2): 268–279.
O. Pironneau and E. Polak, Rate of convergence of a class of method of feasible directions, SIAM J. Num. Anal., 1973, 1(10): 161–173.
D. Z. Du and J. Sun, A new gradient projection method, Math. Numer. Sinica, 1983, 4: 378–386.
Z. Y. Gao and G. P. He, A generalized gradient projection method for constrained optimization, Kexue Tongbao, 1991, 19: 1444–1447.
Y. L. Lai and J. B. Jian, A generalized gradient projection method with initial point for the optimized problem with nonlinear constraints, J. Sys. Sci. and Math. Scis., 1995, 15(4): 374–380.
D. Z. Du, A gradient projection algorithm for nonlinear constraints, J. Acta Math. Appl. Sini., 1985, 8: 7–16.
S. J. Xue and J. B. Jian, A generalized gradient projection method under nonlinear constraints, J. Jinan Univ., 1997, 18(1): 27–32.
D. Z. Du, A modification of Rosen-Polak’s algorithm, Kexue Tongbao, 1983, 28: 301–305.
E. Polak, R. Trhan, and D. Q. Mayne, Combined Phase I-Phase II methods of feasible directions, Math. Prog., 1979, 17: 61–73.
J. B. Jian, Strong combined Phase I-Phase II methods of sub-feasible directions, J. Math. Econom., 1995, 12(1): 64–70.
J. B. Jian, Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, Ph. D. Thesis, School of Xi’an Jiaotong Univ., Xi’an, China, 2000.
J. B. Jian and K. C. Zhang, Sub-feasible direction method with strong convergence for inequality constrained optimization, J. Xi’ an Jiaotong Univ., 1999, 33(8): 88–103.
J. B. Jian and Y. M. Liang, Finitely convergent algorithm of generalized gradient projection for systems of nonlinear inequalities, Neural, Parallel and Sci. Comput., 2004, 12: 207–218.
M. Fukushima, A finitely convergent algorithm for convex inequalities, IEEE Trams. Autom. Contr., 1982, 27(5): 1126–1127.
J. B. Jian, X. L. Zhang, and R. Quan, A new finitely convergent algorithm for systems of nonlinear inequalities, Appl. Math. Letter, 2007, 20(4): 405–411.
O. A. Elwakeil and J. S. Arora, Methods for finding feasible points in constrained optimization, AIAA Journal, 1995, 33(9): 1715–1719.
J. B. Jian, W. X. Cheng, and X. Y. Ke, Finitely convergent ɛ-generalized projection algorithm for nonlinear systems, J. Math. Anal. Appl., 2007, 332(2): 1445–1458.
W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Springer, 1981.
I. Bongartz, A. R. Conn, N. I. Gould, and PH. L. Toint, CUTE: Constrained and unconstrained testing environment, ACM Tras. Math. Software, 1995, 21: 123–160.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science Foundation of China under Grant Nos. 71061002 and 10771040, the Project supported by Guangxi Science Foundation under Grant No. 0832052, and Science Foundation of Guangxi Education Department under Grant No. 200911MS202.
This paper was recommended for publication by Editor Xiaoguang YANG.
Rights and permissions
About this article
Cite this article
Jian, J., Ma, G. & Guo, C. A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization. J Syst Sci Complex 24, 604–618 (2011). https://doi.org/10.1007/s11424-011-8105-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-011-8105-5