Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 65, 2016 - Issue 4
Submit an article Journal homepage
219
Views
2
CrossRef citations to date
0
Altmetric
Articles

A spline smoothing homotopy method for nonconvex nonlinear programming

Li DongSchool of Mathematical Sciences, Dalian University of Technology, Dalian, P.R. China.;College of Science, Dalian Nationalities University, Dalian, P.R. China.View further author information
,
Bo YuSchool of Mathematical Sciences, Dalian University of Technology, Dalian, P.R. China.Correspondence[email protected]
View further author information
&
Guohui ZhaoSchool of Mathematical Sciences, Dalian University of Technology, Dalian, P.R. China.View further author information
Pages 729-749 | Received 26 Feb 2014, Accepted 05 Jun 2015, Published online: 13 Jul 2015

References

  • Kortanek KO, Potra F, Ye Y. On some efficient interior point algorithms for nonlinear convex programming. Linear Algebra Appl. 1991;152:169–189.
  • Monteiro RDC, Adler I. An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence. Math. Oper. Res. 1990;15:408–422.
  • Wang Y, Feng GC, Liu TZ. Interior point algorithm for convex nonlinear programming problems. Numer. Math. J. Chinese Univ. 1992;1:1–8.
  • Zhu J. A path following algorithm for a class of convex programming problems. ZOR-Methods Models Oper. Res. 1992;36:359–377.
  • Feng GC, Lin ZH, Yu B. Existence of an interior pathway to a Karush--Kuhn--Tucker point of a nonconvex programming problem. Nonlinear Anal. 1998;32:761–768.
  • Feng GC, Yu B. Combined homotopy interior point method for nonlinear programming problems. In: Advances in numerical mathematics; Proceedings of the Second Japan--China Seminar on Numerical Mathematics (Tokyo, 1994). Vol. 14, Lecture notes in numerical and applied analysis. Tokyo: Kinokuniya; 1995. p. 9–16.
  • Lin ZH, Yu B, Feng GC. A combined homotopy interior point method for convex nonlinear programming. Appl. Math. Comput. 1997;84:193–211.
  • Liu QH, Yu B, Feng GC. An interior point path following method for nonconvex nonlinear programming problem with quasi normal cone condition. Adv. Math. 2000;19:281–282.
  • Yu B, Liu QH, Feng GC. A combined homotopy interior point method for nonconvex programming with pseudo cone condition, Northeast. Math. J. 2000;16:383–386.
  • Shang YF, Yu B. Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence. J. Jilin Univ. Sci. 2006;44:357–361.
  • Yu B, Feng GC, Zhang SL. The aggregate constraint homotopy method for nonconvex nonlinear programming. Nonlinear. Anal. 2001;45:839–847.
  • Li XS. An aggregate function method for nonlinear programming. Sci. China (Ser. A). 1991;34:1467–1473.
  • Zhao GH, Wang ZR, Mou HN. Uniform approximation of min--max functions by smooth splines. J. Comput. Appl. Math. 2011;236:699–703.
  • Bates SM. Toward a precise smoothness hypothesis in Sard’s theorem. Proc. Amer. Math. Soc. 1993;117:279–283.
  • Naber GL. Topological methods in Euclidean spaces. Mineola (NY): Dover Publications Inc.; 2000. Reprint of the original (1980).
  • Abraham R, Robbin J. Transversal mappings and flows. New York (NY): Benjamin; 1967.
  • Gould NIM, Orban D, Toint PL. CUTEr (and sifdec), a constrained and unconstrained testing environment, revisted. Technical report TR/PA/01/04. Toulouse, France: CERFACS; 2001.
  • Zhou ZY, Yu B. The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints. Abstr. Appl. Anal. 2014;2014:1–14.
  • Li DH, Qi LQ, Tam J, Wu SY. A smoothing Newton method for semi-infinite programming. J. Global Optim. 2004;30:169–194.
  • Ni Q, Ling C, Qi LQ, Teo KL. A truncated projected Newton-type algorithm for large-scale semi-infinite programming. SIAM J. Optim. 2006;16:1137–1154.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.