On penalty method for equilibrium problems in lexicographic order

DOI10.1007/s11117-017-0496-7zbMath1493.47078OpenAlexW2610891617MaRDI QIDQ1746010

T. Q. Duy, Lam Quoc Anh

Publication date: 19 April 2018

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-017-0496-7

zbMATH Keywords

lexicographic ordererror boundpenalty methodequilibrium problemgap function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

Regularization of vector equilibrium problems ⋮ Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuity properties of solution maps of parametric lexicographic equilibrium problems
• On penalty and gap function methods for bilevel equilibrium problems
• Gap functions and error bounds for generalized mixed vector equilibrium problems
• On lexicographic vector equilibrium problems
• Gap functions and error bounds for quasi variational inequalities
• On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
• A bundle method for solving equilibrium problems
• Lexicographic and sequential equilibrium problems
• Proximal methods for a class of bilevel monotone equilibrium problems
• Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Gap functions for equilibrium problems
• Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
• Foundations of bilevel programming
• Equivalent optimization formulations and error bounds for variational inequality problems
• Exact and inexact penalty methods for the generalized bilevel programming problem
• Regularized penalty method for general equilibrium problems in Banach spaces
• Gap functions and existence of solutions to generalized vector quasi-equilibrium problems
• Generalized monotone bifunctions and equilibrium problems
• A new solution method for equilibrium problems
• Calculus Without Derivatives
• Convex Optimization in Normed Spaces
• Twelve monotonicity conditions arising from algorithms for equilibrium problems
• Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
• Motion under a strong constraining force
• A lagrangian penalty function method for monotone variational inequalities
• Variational principles for variational inequalities
• Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
• Asymptotic Analysis for Penalty and Barrier Methods in Variational Inequalities
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• D-gap Functions for a Class of Equilibrium Problems in Banach Spaces
• Exact Penalty Functions in Constrained Optimization
• Lexicographic variational inequalities with applications
• Well-Posedness for Lexicographic Vector Equilibrium Problems
• Variational methods for the solution of problems of equilibrium and vibrations

This page was built for publication: On penalty method for equilibrium problems in lexicographic order