Gilson do Nascimento Silva, R. Andreani, Rui Marques Carvalho, L. Secchin
{"title":"Convergence of quasi-Newton methods for solving constrained generalized equations\n \n \n \n \n \n \n \n ","authors":"Gilson do Nascimento Silva, R. Andreani, Rui Marques Carvalho, L. Secchin","doi":"10.1051/cocv/2022026","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on quasi-Newton methods to solve constrained generalized equations.As is well-known, this problem was firstly studied by Robinson and Josephy in the 70's.\nSince then, it has been extensively studied by many other researchers, specially Dontchev and Rockafellar.\nHere, we propose two Broyden-type quasi-Newton approaches to dealing with constrained generalized equations, one that requires the exact resolution of the subproblems, and other that allows inexactness, which is closer to numerical reality.\nIn both cases, projections onto the feasible set are also inexact.\nThe local convergence of general quasi-Newton approaches is established under a bounded deterioration of the update matrix and Lipschitz continuity hypotheses.\nIn particular, we prove that a general scheme converges linearly to the solution under suitable assumptions.\nFurthermore, when a Broyden-type update rule is used, the convergence is superlinearly.\nSome numerical examples illustrate the applicability of the proposed methods.","PeriodicalId":50500,"journal":{"name":"Esaim-Control Optimisation and Calculus of Variations","volume":"96 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Esaim-Control Optimisation and Calculus of Variations","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1051/cocv/2022026","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper, we focus on quasi-Newton methods to solve constrained generalized equations.As is well-known, this problem was firstly studied by Robinson and Josephy in the 70's.
Since then, it has been extensively studied by many other researchers, specially Dontchev and Rockafellar.
Here, we propose two Broyden-type quasi-Newton approaches to dealing with constrained generalized equations, one that requires the exact resolution of the subproblems, and other that allows inexactness, which is closer to numerical reality.
In both cases, projections onto the feasible set are also inexact.
The local convergence of general quasi-Newton approaches is established under a bounded deterioration of the update matrix and Lipschitz continuity hypotheses.
In particular, we prove that a general scheme converges linearly to the solution under suitable assumptions.
Furthermore, when a Broyden-type update rule is used, the convergence is superlinearly.
Some numerical examples illustrate the applicability of the proposed methods.
期刊介绍:
ESAIM: COCV strives to publish rapidly and efficiently papers and surveys in the areas of Control, Optimisation and Calculus of Variations.
Articles may be theoretical, computational, or both, and they will cover contemporary subjects with impact in forefront technology, biosciences, materials science, computer vision, continuum physics, decision sciences and other allied disciplines.
Targeted topics include:
in control: modeling, controllability, optimal control, stabilization, control design, hybrid control, robustness analysis, numerical and computational methods for control, stochastic or deterministic, continuous or discrete control systems, finite-dimensional or infinite-dimensional control systems, geometric control, quantum control, game theory;
in optimisation: mathematical programming, large scale systems, stochastic optimisation, combinatorial optimisation, shape optimisation, convex or nonsmooth optimisation, inverse problems, interior point methods, duality methods, numerical methods, convergence and complexity, global optimisation, optimisation and dynamical systems, optimal transport, machine learning, image or signal analysis;
in calculus of variations: variational methods for differential equations and Hamiltonian systems, variational inequalities; semicontinuity and convergence, existence and regularity of minimizers and critical points of functionals, relaxation; geometric problems and the use and development of geometric measure theory tools; problems involving randomness; viscosity solutions; numerical methods; homogenization, multiscale and singular perturbation problems.