IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaaa/108184.html
   My bibliography  Save this article

Numerical Reduced Variable Optimization Methods via Implicit Functional Dependence with Applications

Author

Listed:
  • Christopher Gunaseelan Jesudason

Abstract

A systematic theoretical basis is developed that optimizes an arbitrary number of variables for (i) modeling data and (ii) the determination of stationary points of a function of several variables by the optimization of an auxiliary function of a single variable deemed the most significant on physical, experimental or mathematical grounds from which all the other optimized variables may be derived. Algorithms that focus on a reduced variable set avoid problems associated with multiple minima and maxima that arise because of the large numbers of parameters. For (i), both approximate and exact methods are presented, where the single controlling variable k of all the other variables passes through the local stationary point of the least squares metric. For (ii), an exact theory is developed whereby the solution of the optimized function of an independent variation of all parameters coincides with that due to single parameter optimization of an auxiliary function. The implicit function theorem has to be further qualified to arrive at this result. A nontrivial real world application of the above implicit methodology to rate constant and final concentration parameter determination is made to illustrate its utility. This work is more general than the reduction schemes for conditional linear parameters since it covers the nonconditional case as well and has potentially wide applicability.

Suggested Citation

  • Christopher Gunaseelan Jesudason, 2014. "Numerical Reduced Variable Optimization Methods via Implicit Functional Dependence with Applications," Abstract and Applied Analysis, Hindawi, vol. 2014, pages 1-13, August.
  • Handle: RePEc:hin:jnlaaa:108184
    DOI: 10.1155/2014/108184
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AAA/2014/108184.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/AAA/2014/108184.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/108184?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlaaa:108184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.