Merit functions: a bridge between optimization and equilibria

Massimo Pappalardo (), Giandomenico Mastroeni () and Mauro Passacantando ()
Additional contact information
Massimo Pappalardo: Università di Pisa
Giandomenico Mastroeni: Università di Pisa
Mauro Passacantando: Università di Pisa

Annals of Operations Research, 2016, vol. 240, issue 1, No 11, 299 pages

Abstract: Abstract In the last decades, many problems involving equilibria, arising from engineering, physics and economics, have been formulated as variational mathematical models. In turn, these models can be reformulated as optimization problems through merit functions. This paper aims at reviewing the literature about merit functions for variational inequalities, quasi-variational inequalities and abstract equilibrium problems. Smoothness and convexity properties of merit functions and solution methods based on them will be presented.

Keywords: Merit functions; Gap functions; Variational inequalities; Equilibrium problems; Descent methods (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-015-2013-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2013-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2013-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().