A generalized computing paradigm based on artificial dynamic models for mathematical programming
The authors consider nonlinear equation systems of the form \[ g_i(x) = 0, i = 1, \dots, N, \] where \(g_i:\mathbb R^n \to\mathbb R\) are continuously differentiable functions. The traditional approach to such problems, which minimizes the sum of the squared residuals may fail in the presence of singularities of the Jacobian matrix or if the initial solution guess is far away from the solution of the given problem. To overcome these difficulties, the authors propose to formulate a generic programming problem by a proper set of ordinary differential equations, whose equilibrium points correspond to the solutions of the given problem. The proposed method is described, its asymptotic stability is demonstrated. Effectiveness of the proposed approach is shown on numerical results presented in the concluding part of the paper.
- Convergence analysis of a differential equation approach for solving nonlinear programming problems
- scientific article; zbMATH DE number 3868511
- Finding a stable solution of a system of nonlinear equations arising from dynamic systems
- The Gauss-Newton method for finding singular solutions to systems of nonlinear equations
- The solution of systems of non-linear equations of general form
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A survey of recent developments in multiobjective optimization
- An interior point method for general large-scale quadratic programming problems
- scientific article; zbMATH DE number 778129 (Why is no real title available?)
- scientific article; zbMATH DE number 2201293 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Reference direction approach for solving multiple objective nonlinear programming problems
- Sizing and Least-Change Secant Methods
- Survey of multi-objective optimization methods for engineering
- Trust Region Methods
This page was built for publication: A generalized computing paradigm based on artificial dynamic models for mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894649)