• DocumentCode
    2508362
  • Title

    A Note on Separable Nonlinear Least Squares Problem

  • Author

    Gharibi, Wajeb ; Al-Mushayt, Omar Saeed

  • Author_Institution
    Comput. Sci. & Inf. Syst. Coll., Jazan Univ., Jazan, Saudi Arabia
  • fYear
    2011
  • fDate
    18-19 June 2011
  • Firstpage
    54
  • Lastpage
    56
  • Abstract
    Separable nonlinear least squares (SNLS) problem is a special class of nonlinear least squares (NLS) problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas, especially in Operations Research and Computer Sciences. They are difficult to solve with the infinite-norm metric. In this paper, we give a short note on the separable nonlinear least squares problem, unseparated scheme for NLS, and propose an algorithm for solving mixed linear-nonlinear minimization problem, method of which results in solving a series of least squares separable problems.
  • Keywords
    least squares approximations; linear programming; minimisation; nonlinear programming; infinite-norm metric; linear function; mixed linear-nonlinear minimization problem; nonlinear function; separable nonlinear least squares problem; Algorithm design and analysis; Artificial neural networks; Convergence; Minimization; Numerical analysis; Operations research; Robots; Lagrangian dual; Nonlinear least squares problem; infinite-norm minimization problem; least squares; subgradient method;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Future Computer Sciences and Application (ICFCSA), 2011 International Conference on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4577-0317-1
  • Type

    conf

  • DOI
    10.1109/ICFCSA.2011.19
  • Filename
    5968024