Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2015, Article ID 429595, 2 pages

Nonlinear Analysis: Optimization Methods, Convergence Theory, and Applications

1College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004, China
2School of Mathematics and Computer Sciences, Gannan Normal University, Ganzhou 341000, China
3Research Institute for Informatics (ICI), 8-10 Averescu Avenue, 71316 Bucharest 1, Romania
4College of Mathematics and Information Science, Henan University, Kaifeng 475000, China
5Department of Mathematics, Changsha University of Science and Technology, Changsha 410004, China

Received 1 March 2015; Accepted 1 March 2015

Copyright © 2015 Gonglin Yuan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Nonlinear analysis has been used in many practical application fields, such as nonlinear fitting, economics, optimization, convergence, engineering, hydrodynamics, parameter estimating, function approximating, and elasticity. There are many achievements on nonlinear analysis that have been obtained by authors. However, there still exist lots of challenging problems, such as the large-scale problems, fast algorithm, and convergence, since the complex of the nonlinear object function on its variables cannot be obviously determined in many cases. So the research and application space of nonlinear analysis are broad.

The issue invites investigators to contribute original research articles as well as review articles that will help in understanding the important new developments in nonlinear analysis and its applications with a particular emphasis on the following potential topics. There exist many special topics including the nonlinear analysis: optimization, variation analysis, economical models, fixed point theory, numerical methods, convergence, nonlinear equations, semidefinite programming, polynomial optimization, tensor computation, image processing, and so forth.

The research papers are welcome with new ideas or good numerical experiments. (1) New methods for nonlinear analysis are encouraged, such as the new formulas on conjugate gradient methods, quasi-Newton methods, limited memory quasi-Newton method, trust region methods, and SQP methods; convergence results of algorithms are established which is needed. (2) Numerical experiments should be done to improve the theory idea: for unconstrained optimization problems, the CUTEr problems should be tested [1, 2] in Table 1. For nonlinear equations problems, there are many problems [37] that are listed in Table 2.

Table 1
Table 2

We hope that readers of this special issue will find not only convergence results and updated reviews on the common nonlinear analysis, but also important open problems to be resolved such as new formulas in optimization methods, new algorithms for variation analysis and new models for economic problems. Moreover, large-scale problems in nonlinear equations, semidefinite programming, and image processing are tested to turn out the performance of the new methods.

Gonglin Yuan
Gaohang Yu
Neculai Andrei
Yunhai Xiao
Li Zhang


  1. I. Bongartz, A. R. Conn, N. I. Gould, and P. L. Toint, “CUTE: constrained and unconstrained testing environment,” ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123–160, 1995. View at Publisher · View at Google Scholar · View at Scopus
  2. N. I. M. Gould, D. Orban, and P. L. Toint, “CUTEr and sifdec: a constrained and unconstrained testing environment, revisited,” ACM Transactions on Mathematical Software, vol. 29, no. 4, pp. 373–394, 2003. View at Publisher · View at Google Scholar · View at Scopus
  3. M. A. Gomes-Ruggiero, J. M. Martínez, and A. C. Moretti, “Comparing algorithms for solving sparse nonlinear systems of equations,” SIAM Journal on Scientific and Statistical Computing, vol. 13, no. 2, pp. 459–483, 1992. View at Google Scholar
  4. G. Y. Li, “Successive column correction algorithms for solving sparse nonlinear systems of equations,” Mathematical Programming, vol. 43, no. 2, pp. 187–207, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  5. B. Yang and L. Gao, “An efficient implementation of Merrill's method for sparse or partially separable systems of nonlinear equations,” SIAM Journal on Optimization, vol. 1, no. 2, pp. 206–221, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  6. J. J. Moré, B. S. Garbow, and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Transactions on Mathematical Software, vol. 7, no. 1, pp. 17–41, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  7. S. M. Roberts and J. S. Shipman, “On the closed form solution of Troesch's problem,” Journal of Computational Physics, vol. 21, no. 3, pp. 291–304, 1976. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus