We study a residual–based a posteriori error estimate for the solution of Dirichlet boundary control problem governed by a convection diffusion equation on a two dimensional convex polygonal domain, using the local discontinuous Galerkin (LDG) method with upwinding for the convection term. With the usage of LDG method, the control variable naturally exists in the variational form due to its mixed finite element structure. We also demonstrate the application of our a posteriori error estimator for the adaptive solution of these optimal control problems.
{"title":"Residual based a posteriori error estimation for Dirichlet boundary control problems","authors":"Hamdullah Yücel","doi":"10.1051/proc/202171185","DOIUrl":"https://doi.org/10.1051/proc/202171185","url":null,"abstract":"We study a residual–based a posteriori error estimate for the solution of Dirichlet boundary control problem governed by a convection diffusion equation on a two dimensional convex polygonal domain, using the local discontinuous Galerkin (LDG) method with upwinding for the convection term. With the usage of LDG method, the control variable naturally exists in the variational form due to its mixed finite element structure. We also demonstrate the application of our a posteriori error estimator for the adaptive solution of these optimal control problems.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76721522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we discuss a particular class of Nash games, where the participants of the game (the players) are divided into two groups (leaders and followers) according to their position or influence on the other players. Moreover, we consider the case, when the leaders’ and/or the followers’ game can be described as a potential game. This is a subclass of Nash games that has been introduced by Monderer and Shapley in 1996 and has beneficial properties to reformulate the bilevel Nash game. We develope necessary and sufficient conditions for Nash equilibria and present existence and uniqueness results. Furthermore, we discuss some Examples to illustrate our results. In this paper, we discussed analytical properties for multi-leader follower potential games, that form a subclass of hierarchical Nash games. The application of these theoretical results to various fields of applications are a future research topic. Moreover, they are meant to serve as a starting point for the developement of efficient numerical solution methods for multi-leader-follower games.
{"title":"Multi-leader-follower potential games","authors":"S. Steffensen","doi":"10.1051/proc/202171155","DOIUrl":"https://doi.org/10.1051/proc/202171155","url":null,"abstract":"In this paper, we discuss a particular class of Nash games, where the participants of the game (the players) are divided into two groups (leaders and followers) according to their position or influence on the other players. Moreover, we consider the case, when the leaders’ and/or the followers’ game can be described as a potential game. This is a subclass of Nash games that has been introduced by Monderer and Shapley in 1996 and has beneficial properties to reformulate the bilevel Nash game. We develope necessary and sufficient conditions for Nash equilibria and present existence and uniqueness results. Furthermore, we discuss some Examples to illustrate our results. In this paper, we discussed analytical properties for multi-leader follower potential games, that form a subclass of hierarchical Nash games. The application of these theoretical results to various fields of applications are a future research topic. Moreover, they are meant to serve as a starting point for the developement of efficient numerical solution methods for multi-leader-follower games.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87488969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
From September 17 to 20, 2019, the 19th edition of the bi-annual applied math conference that gathers the German and French communities of optimisation in the large, took place in Nice. This series of conferences began at Oberwolfach in 1980 and has been gathering since, every other year, researchers from Germany, France, and from a third invited country. The two previous editions had taken place in London (2015, the invited country was England) and Paderborn (2017, the invited country was Italy). In 2019, the invited country was Switzerland. More than 150 mathematicians participated to the event. The conference benefited from the scientific patronage and the support of the following institutions:
{"title":"19th French-German-Swiss conference on Optimization September 2019, Nice","authors":"Marc Pfetzsch, S. Pokutta","doi":"10.1051/proc/202171100","DOIUrl":"https://doi.org/10.1051/proc/202171100","url":null,"abstract":"From September 17 to 20, 2019, the 19th edition of the bi-annual applied math conference that gathers the German and French communities of optimisation in the large, took place in Nice. This series of conferences began at Oberwolfach in 1980 and has been gathering since, every other year, researchers from Germany, France, and from a third invited country. The two previous editions had taken place in London (2015, the invited country was England) and Paderborn (2017, the invited country was Italy). In 2019, the invited country was Switzerland. More than 150 mathematicians participated to the event. The conference benefited from the scientific patronage and the support of the following institutions:","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85662865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper a generalization of the indirect pseudo-spectral method, presented in [17], for the numerical solution of budget-constrained infinite horizon optimal control problems is presented. Consideration of the problem statement in the framework of weighted functional spaces allows to arrive at a good approximation for the initial value of the adjoint variable, which is inevitable for obtaining good numerical solutions. The presented method is illustrated by applying it to the budget-constrained linear-quadratic regulator model. The quality of approximate solutions is demonstrated by an example.
{"title":"A pseudospectral method for budget-constrained infinite horizon optimal control problems","authors":"Angie Burtchen, Valeriya Lykina, S. Pickenhain","doi":"10.1051/proc/202171145","DOIUrl":"https://doi.org/10.1051/proc/202171145","url":null,"abstract":"In this paper a generalization of the indirect pseudo-spectral method, presented in [17], for the numerical solution of budget-constrained infinite horizon optimal control problems is presented. Consideration of the problem statement in the framework of weighted functional spaces allows to arrive at a good approximation for the initial value of the adjoint variable, which is inevitable for obtaining good numerical solutions. The presented method is illustrated by applying it to the budget-constrained linear-quadratic regulator model. The quality of approximate solutions is demonstrated by an example.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"67 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81160966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Francesca Calà Campana, A. Marchi, A. Borzì, M. Gerdts
A functional formulation of the classical homicidal chauffeur Nash game is presented and a numerical framework for its solution is discussed. This methodology combines a Hamiltonian based scheme with proximal penalty to determine the time horizon where the game takes place with a Lagrangian optimal control approach and relaxation to solve the Nash game at a fixed end-time.
{"title":"On the numerical solution of a free end-time homicidal chauffeur game","authors":"Francesca Calà Campana, A. Marchi, A. Borzì, M. Gerdts","doi":"10.1051/proc/202171104","DOIUrl":"https://doi.org/10.1051/proc/202171104","url":null,"abstract":"A functional formulation of the classical homicidal chauffeur Nash game is presented and a numerical framework for its solution is discussed. This methodology combines a Hamiltonian based scheme with proximal penalty to determine the time horizon where the game takes place with a Lagrangian optimal control approach and relaxation to solve the Nash game at a fixed end-time.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"45 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88295409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The first aim of this article is to present the link between the turnpike property and the singular perturbations theory: the first one being a particular case of the second one. Then, thanks to this link, we set up a new framework based on continuation methods for the resolution of singularly perturbed optimal control problems. We consider first the turnpike case, then, we generalize the approach to general control problems with singular perturbations (that is with fast but also slow variables). We illustrate each step with an example.
{"title":"Homotopic approach for turnpike and singularly perturbed optimal control problems","authors":"O. Cots, J. Gergaud, B. Wembe","doi":"10.1051/proc/202171105","DOIUrl":"https://doi.org/10.1051/proc/202171105","url":null,"abstract":"The first aim of this article is to present the link between the turnpike property and the singular perturbations theory: the first one being a particular case of the second one. Then, thanks to this link, we set up a new framework based on continuation methods for the resolution of singularly perturbed optimal control problems. We consider first the turnpike case, then, we generalize the approach to general control problems with singular perturbations (that is with fast but also slow variables). We illustrate each step with an example.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78948011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a new method for global optimization. We use exact quadratic regularization for the transformation of the multimodal problems to a problem of a maximum norm vector on a convex set. Quadratic regularization often allows you to convert a multimodal problem into a unimodal problem. For this, we use the shift of the feasible region along the bisector of the positive orthant. We use only local search (primal-dual interior point method) and a dichotomy method for search of a global extremum in the multimodal problems. The comparative numerical experiments have shown that this method is very efficient and promising.
{"title":"A new method for global optimization","authors":"A. Kosolap","doi":"10.1051/proc/202171121","DOIUrl":"https://doi.org/10.1051/proc/202171121","url":null,"abstract":"This paper presents a new method for global optimization. We use exact quadratic regularization for the transformation of the multimodal problems to a problem of a maximum norm vector on a convex set. Quadratic regularization often allows you to convert a multimodal problem into a unimodal problem. For this, we use the shift of the feasible region along the bisector of the positive orthant. We use only local search (primal-dual interior point method) and a dichotomy method for search of a global extremum in the multimodal problems. The comparative numerical experiments have shown that this method is very efficient and promising.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80840534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this note, we propose a new method to approximate the minimal time crisis problem using an auxiliary control and a penalty function, and show its convergence to a solution to the original problem. The interest of this approach is illustrated on numerical examples for which optimal trajectories can leave and enter the crisis set tangentially.
{"title":"Penalty function method for the minimal time crisis problem","authors":"Kenza Boumaza, T. Bayen, Alain Rapaport","doi":"10.1051/proc/202171103","DOIUrl":"https://doi.org/10.1051/proc/202171103","url":null,"abstract":"In this note, we propose a new method to approximate the minimal time crisis problem using an auxiliary control and a penalty function, and show its convergence to a solution to the original problem. The interest of this approach is illustrated on numerical examples for which optimal trajectories can leave and enter the crisis set tangentially.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"155 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73477133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper deals with supervised classification and feature selection with application in the context of high dimensional features. A classical approach leads to an optimization problem minimizing the within sum of squares in the clusters (I2 norm) with an I1 penalty in order to promote sparsity. It has been known for decades that I1 norm is more robust than I2 norm to outliers. In this paper, we deal with this issue using a new proximal splitting method for the minimization of a criterion using I2 norm both for the constraint and the loss function. Since the I1 criterion is only convex and not gradient Lipschitz, we advocate the use of a Douglas-Rachford minimization solution. We take advantage of the particular form of the cost and, using a change of variable, we provide a new efficient tailored primal Douglas-Rachford splitting algorithm which is very effective on high dimensional dataset. We also provide an efficient classifier in the projected space based on medoid modeling. Experiments on two biological datasets and a computer vision dataset show that our method significantly improves the results compared to those obtained using a quadratic loss function.
{"title":"Robust classification with feature selection using an application of the Douglas-Rachford splitting algorithm","authors":"M. Barlaud, M. Antonini","doi":"10.1051/proc/202171102","DOIUrl":"https://doi.org/10.1051/proc/202171102","url":null,"abstract":"This paper deals with supervised classification and feature selection with application in the context of high dimensional features. A classical approach leads to an optimization problem minimizing the within sum of squares in the clusters (I2 norm) with an I1 penalty in order to promote sparsity. It has been known for decades that I1 norm is more robust than I2 norm to outliers. In this paper, we deal with this issue using a new proximal splitting method for the minimization of a criterion using I2 norm both for the constraint and the loss function. Since the I1 criterion is only convex and not gradient Lipschitz, we advocate the use of a Douglas-Rachford minimization solution. We take advantage of the particular form of the cost and, using a change of variable, we provide a new efficient tailored primal Douglas-Rachford splitting algorithm which is very effective on high dimensional dataset. We also provide an efficient classifier in the projected space based on medoid modeling. Experiments on two biological datasets and a computer vision dataset show that our method significantly improves the results compared to those obtained using a quadratic loss function.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74557354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Multigrid methods for two-body contact problems are mostly based on special mortar discretizations, nonlinear Gauss-Seidel solvers, and solution-adapted coarse grid spaces. Their high computational efficiency comes at the cost of a complex implementation and a nonsymmetric master-slave discretization of the nonpenetration condition. Here we investigate an alternative symmetric and overconstrained segment-to-segment contact formulation that allows for a simple implementation based on standard multigrid and a symmetric treatment of contact boundaries, but leads to nonunique multipliers. For the solution of the arising quadratic programs, we propose augmented Lagrangian multigrid with overlapping block Gauss-Seidel smoothers. Approximation and convergence properties are studied numerically at standard test problems.
{"title":"Multilevel augmented Lagrangian solvers for overconstrained contact formulations","authors":"R. Krause, M. Weiser","doi":"10.1051/proc/202171175","DOIUrl":"https://doi.org/10.1051/proc/202171175","url":null,"abstract":"Multigrid methods for two-body contact problems are mostly based on special mortar discretizations, nonlinear Gauss-Seidel solvers, and solution-adapted coarse grid spaces. Their high computational efficiency comes at the cost of a complex implementation and a nonsymmetric master-slave discretization of the nonpenetration condition. Here we investigate an alternative symmetric and overconstrained segment-to-segment contact formulation that allows for a simple implementation based on standard multigrid and a symmetric treatment of contact boundaries, but leads to nonunique multipliers. For the solution of the arising quadratic programs, we propose augmented Lagrangian multigrid with overlapping block Gauss-Seidel smoothers. Approximation and convergence properties are studied numerically at standard test problems.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84674927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：