Variatoinal inequalities and convex semi-infinite programming problems
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 26 (3) , 187-214
- https://doi.org/10.1080/02331939208843852
Abstract
The present paper is concerned with a general approach for the construction of stable methods solving convex variational problems. This approach uses the procedure of iterative PROX-regularization in connection with suitable methods of sequential discretizations of convex variational inequalities and semi-infinite programming problems. The presented investigation scheme for such methods allows to establish conditions which control the behaviour of the methods and guarantee the strong convergence of the obtained minimizing sequence. The possibility of realizing of this scheme is described for some concrete elliptical variational inequalities and also for some numerical algorithms, where the parameters of discretization and of convergence controlling are coordinated.Keywords
This publication has 6 references indexed in Scilit:
- Convergence rate estimates for regularized methods of solving variational problemsRussian Journal of Numerical Analysis and Mathematical Modelling, 1989
- Reduction and Discrete Approximation in Linear Semi-Infinite ProgrammingOptimization, 1987
- On the solution of discretized obstacle problems by an adapted penalty methodComputing, 1985
- Brève communication. Régularisation d'inéquations variationnelles par approximations successivesRevue française d'informatique et de recherche opérationnelle. Série rouge, 1970
- Convergence of convex sets and of solutions of variational inequalitiesAdvances in Mathematics, 1969
- OptimierungsaufgabenPublished by Springer Nature ,1966