A generalized computing paradigm based on artificial dynamic models for mathematical programming (Q894649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An interior point method for general large-scale quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Methods for Solving Nonlinear Simultaneous Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent developments in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sizing and Least-Change Secant Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of multi-objective optimization methods for engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reference direction approach for solving multiple objective nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank

Latest revision as of 03:11, 11 July 2024

scientific article
Language Label Description Also known as
English
A generalized computing paradigm based on artificial dynamic models for mathematical programming
scientific article

    Statements

    A generalized computing paradigm based on artificial dynamic models for mathematical programming (English)
    0 references
    0 references
    2 December 2015
    0 references
    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.
    0 references
    dynamic system theory
    0 references
    nonlinear systems of equations
    0 references
    non-linear optimization problems
    0 references
    Lyapunov theory
    0 references

    Identifiers