Application of the penalty method to nonstationary approximation of an optimization problem

DOI10.3103/S1066369X14080064zbMath1299.90346MaRDI QIDQ465144

J. Herrera, D. Rodríguez-Gómez

Publication date: 31 October 2014

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

optimization problemcoercivity conditionspenalty methodnon-stationarityapproximation sequence

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (4)

Decentralized multi-agent optimization based on a penalty method ⋮ Iterative Method for Non-Stationary Mixed Variational Inequalities ⋮ Two-level iterative method for non-stationary mixed variational inequalities ⋮ Application of the penalty method to limit quasi-equilibrium problems

Cites Work

• Penalization in non-classical convex programming via variational convergence
• A global regularization method for solving the finite min-max problem
• Convergence of diagonally stationary sequences in convex optimization
• Coupling the proximal point algorithm with approximation methods
• Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
• Coupling proximal methods and variational convergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of the penalty method to nonstationary approximation of an optimization problem