Numerical reduced variable optimization methods via implicit functional dependence with applications

DOI10.1155/2014/108184MaRDI QIDQ1722110zbMATH OpenOpenAlexWikidataFDO

Authors Christopher Gunaseelan Jesudason

Publication date 14 February 2019

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1307.2443

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Abstract: Optimization methods have been broadly applied to two classes of objects viz. (i) modeling and description of data and (ii) the determination of the stationary points of functions. Here, a theoretical basis is developed that optimizes an arbitrary number of variables for classes (i) and (ii) by the minimization of a function of a single variable. Algorithms that focus on a reduced variable set also avoid problems associated with multiple minima and maxima that arise because of the large numbers of parameters. The methods described could have applications in the physical sciences where the optimization of one physically significant variable has priority over the other variables. For (i), we develop both an approximate but computationally more tractable method and an exact method where the single controlling variable k of all the other variables (P,k) passes through the local stationary point of the least squares (LS) metric. For (ii), an exact theory is developed whereby the optimized function of an independent variation of all parameters coincides with that due to single parameter optimization. The implicit function theorem has to be further qualified to arrive at this result. The topology of the surfaces of constant value of the target or cost function are considered for all the methods. A real world application of the above implicit methodology to rate constant and final concentration parameter determination for first and second order chemical reactions from published data. This work is different from and more general than all the reduction schemes for conditional linear parameters nor is it a subset of the Adomian decomposition method (ADM) used for estimating solutions of differential equations, which still require boundary conditions that do not feature in topics (i) and (ii).

Review text

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 \textit{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.

Recommendations

• Functional optimization by variable-basis approximation schemes
• scientific article; zbMATH DE number 1487875
• scientific article; zbMATH DE number 1046214
• scientific article; zbMATH DE number 2123490
• Numerical evaluation of functionals based on variance minimisation
• A numerical approach to optimization problems with variational inequality constraints
• Approximation schemes for functional optimization problems
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
• Reduced-direction methods for the non-linear programming problem
• Numerical reduction method for doubly nonnegative optimization problems

Cites work

• A filter method with unified step computation for nonlinear optimization
• A generalization of variable elimination for separable inverse problems beyond least squares
• A quadratically convergent Newton method for vector optimization
• A semismooth Newton method with multidimensional filter globalization for l₁-optimization
• Handbook of metaheuristics
• scientific article; zbMATH DE number 3762347 (Why is no real title available?)
• scientific article; zbMATH DE number 41948 (Why is no real title available?)
• scientific article; zbMATH DE number 194144 (Why is no real title available?)
• Numerical recipes. The art of scientific computing.
• Optimization by simulated annealing
• Optimization of Transmission Conditions in Waveform Relaxation Techniques for RC Circuits
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
• The form of the rate constant for elementary reactions at equilibrium from MD: framework and proposals for thermokinetics
• Variable Metric Method for Minimization
• Variables reduction in data envelopment analysis

Cited in

(1)

• Shortcut derivatives for mixed linear-nonlinear least squares regression

Describes a project that uses

Uses Software

• BB

This page was built for publication: Numerical reduced variable optimization methods via implicit functional dependence with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722110)