×

Numerical reduced variable optimization methods via implicit functional dependence with applications. (English) Zbl 1470.90131

Summary: 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 \(\mathbf{P} \left(k\right)\) 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.

MSC:

90C30 Nonlinear programming
65K05 Numerical mathematical programming methods

Software:

BB
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Craven, B. D., Functions of Several Variables (1981), London, UK: Chapman & Hall, London, UK · Zbl 0485.26004
[2] DePree, J.; Swartz, C., Introduction to Real Analysis (1988), New York, NY, USA: John Wiley & Sons, New York, NY, USA · Zbl 0661.26001
[3] Apostol, T. M., Mathematical Analysis (2002), New Delhi, India: Narosa Publishing House, New Delhi, India
[4] Press, W. H.; Teukolsky, S. A.; Vetterling, W. T.; Flannery, B. P., Numerical Recipes—The Art of Scientific Computing (2007), Cambridge, UK: Cambridge University Press, Cambridge, UK · Zbl 1132.65001
[5] Snyman, J. A., Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms (2005), New York, NY, USA: Springer, New York, NY, USA · Zbl 1104.90003
[6] Davidon, W. C., Variable metric method for minimization, SIAM Journal on Optimization, 1, 1, 1-17 (1991) · Zbl 0752.90062 · doi:10.1137/0801001
[7] Broyden, C. G., The convergence of a class of double-rank minimization algorithms, Journal of the Institute of Mathematics and Its Applications, 6, 76-90 (1970) · Zbl 0223.65023
[8] Banerjee, A.; Adams, N.; Simons, J.; Shepard, R., Search for stationary points on surfaces, Journal of Physical Chemistry, 89, 1, 52-57 (1985)
[9] Wales, D. A., Energy Landscapes. Energy Landscapes, Cambridge Molecular Science (2003), Cambridge, UK: Cambridge University Press, Cambridge, UK
[10] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, The American Association for the Advancement of Science. Science, 220, 4598, 671-680 (1983) · Zbl 1225.90162 · doi:10.1126/science.220.4598.671
[11] Bates, D. M.; Watts, D. G., Nonlinear Regression Analysis and Its Applications. Nonlinear Regression Analysis and Its Applications, Wiley Series in Probability and Mathematical Statistics (1988), New York, NY, USA: John Wiley & Sons, New York, NY, USA · Zbl 0728.62062 · doi:10.1002/9780470316757
[12] Golub, G. H.; Pereyra, V., The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate, SIAM Journal on Numerical Analysis, 10, 413-432 (1973) · Zbl 0258.65045
[13] van Stokkum, I. H. M.; Larsen, D. S.; van Grondelle, R., Global and target analysis of time-resolved spectra, Biochimica et Biophysica Acta—Bioenergetics, 1657, 2-3, 82-104 (2004) · doi:10.1016/j.bbabio.2004.04.011
[14] Shearer, P.; Gilbert, A. C., A generalization of variable elimination for separable inverse problems beyond least squares, Inverse Problems, 29, 4 (2013) · Zbl 1276.65035 · doi:10.1088/0266-5611/29/4/045003
[15] Gould, N. I. M.; Loh, Y.; Robinson, D. P., A filter method with unified step computation for nonlinear optimization, SIAM Journal on Optimization, 24, 1, 175-209 (2014) · Zbl 1301.49070 · doi:10.1137/130920599
[16] Milzarek, A.; Ulbrich, M., A semismooth Newton method with multidimensional filter globalization for \(l_1\)-optimization, SIAM Journal on Optimization, 24, 1, 298-333 (2014) · Zbl 1295.49022 · doi:10.1137/120892167
[17] Gomes, H. M., Truss optimization with dynamic constraints using a particle swarm algorithm, Expert Systems with Applications, 38, 1, 957-968 (2011) · doi:10.1016/j.eswa.2010.07.086
[18] Gendreau, M.; Potvin, J.-Y., Handbook of Metaheuristics. Handbook of Metaheuristics, International Series in Operations Research & Management Science, 146 (2010), New York, NY, USA: Springer, New York, NY, USA · Zbl 1198.90002
[19] Varadhan, R.; Gilbert, P. D., BB: an R package for solving a large system of nonlinear equations and for optimizing a high-dimensional nonlinear objective function, Journal of Statistical Software, 32, 4, 1-26 (2009)
[20] Raupp, F. M. P.; Drummond, L. M. G.; Svaiter, B. F., A quadratically convergent Newton method for vector optimization, Optimization, 63, 5, 661-677 (2014) · Zbl 1302.90196 · doi:10.1080/02331934.2012.693082
[21] Al-Khaleel, M. D.; Gander, M. J.; Ruehli, A. E., Optimization of transmission conditions in waveform relaxation techniques for RC circuits, SIAM Journal on Numerical Analysis, 52, 2, 1076-1101 (2014) · Zbl 1300.94127 · doi:10.1137/110854187
[22] Amirteimoori, A.; Despotis, D. K.; Kordrostami, S., Variables reduction in data envelopment analysis, Optimization, 63, 5, 735-745 (2014) · Zbl 1302.90128 · doi:10.1080/02331934.2012.684354
[23] Solar, S.; Solar, W.; Getoff, N., A pulse radiolysis-computer simulation method for resolving of complex kinetics and spectra, Radiation Physics and Chemistry, 21, 1-2, 129-138 (1983)
[24] Wazwaz, A.-M., A note on using Adomian decomposition method for solving boundary value problems, Foundations of Physics Letters, 13, 5, 493-498 (2000) · doi:10.1023/A:1007888917365
[25] Houser, J. J., Estimation of \(A_∞\) in reaction-rate studies, Journal of Chemical Education, 59, 9, 776-777 (1982)
[26] Moore, P., Analysis of kinetic data for a first-order reaction with unknown initial and final readings by the method of non-linear least squares, Journal of the Chemical Society, Faraday Transactions I: Physical Chemistry in Condensed Phases, 68, 1890-1893 (1972) · doi:10.1039/F19726801890
[27] Wentworth, W. E., Rigorous least squares adjustment: application to some non-linear equations, I, Journal of Chemical Education, 42, 2, 96-103 (1965)
[28] Wentworth, W. E., Rigorous least squares adjustment: application to some non-linear equations, II, Journal of Chemical Education, 42, 3, 162-167 (1965)
[29] Jesudason, C. G., The form of the rate constant for elementary reactions at equilibrium from MD: framework and proposals for thermokinetics, Journal of Mathematical Chemistry, 43, 3, 976-1023 (2008) · Zbl 1152.92034 · doi:10.1007/s10910-007-9320-0
[30] Khan, M. N., Micellar Catalysis. Micellar Catalysis, Surfactant Science Series, 133 (2007), Boca Raton, Fla, USA: Taylor & Francis, Boca Raton, Fla, USA
[31] Newton, T. W.; Baker, F. B., The kinetics of the reaction between plutonium(VI) and iron(II), Journal of Physical Chemistry, 67, 7, 1425-1432 (1963)
[32] Espenson, J. H., Chemical Kinetics and Reaction Mechanisms, 102 (1995), Singapore: McGraw-Hill, Singapore
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.