Application of the penalty method to nonstationary approximation of an optimization problem
type: Item
instance of: scholarly article
title: Application of the penalty method to nonstationary approximation of an optimization problem
zbMATH Open document ID: 1299.90346
DOI: 10.3103/S1066369X14080064
published in: Russian Mathematics
publication date: 2014-10-31T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 6362833
zbMATH Keywords: optimization problem
zbMATH Keywords: non-stationarity
zbMATH Keywords: approximation sequence
zbMATH Keywords: penalty method
zbMATH Keywords: coercivity conditions
MaRDI profile type: Publication
cites work: Q3797760
cites work: Q3346839
cites work: Q4747909
cites work: Q4002578
cites work: Q5183284
cites work: Q4128271
cites work: Q3893656
cites work: Q3824951
cites work: Penalization in non-classical convex programming via variational convergence
cites work: Coupling proximal methods and variational convergence
cites work: Convergence of diagonally stationary sequences in convex optimization
cites work: Coupling the proximal point algorithm with approximation methods
cites work: A global regularization method for solving the finite min-max problem
cites work: Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
cites work: Q4531589
cites work: Q4441455
cites work: Q4746738
cites work: Q3960463
author: Igor V. Konnov
description: scientific article; zbMATH DE number 6362833