Paper Info
Title
Partially B-Regular Optimization and Equilibrium Problems
Abstract
This paper introduces a concept termed partial B-regularity for a feasible solution to a bivariate constraint system and shows that this condition leads to the equivalence between the B-stationarity of a pair of lifted and unlifted programs. In particular, for an optimization problem with a univariate pseudoconvex objective function constrained by such a nonconvex bivariate system, partial B-regularity provides a sufficient condition for a B-stationary point to be globally optimal. Applications of partial B-regularity to several classes of optimization and equilibrium problems are presented; these include a lexicographic optimization problem, a nonconvex mathematical program with equilibrium constraints (MPEC) that arises from a convex implicit value-function optimization problem, and a Nash equilibrium program with equilibrium constraints.
Year
DOI
Venue
2007
10.1287/moor.1070.0262
Math. Oper. Res.
Keywords
DocType
Volume
equilibrium constraint,convex implicit value-function optimization,Equilibrium Problems,nonconvex mathematical program,equilibrium problem,optimization problem,partial B-regularity,Nash equilibrium program,nonconvex bivariate system,Partially B-Regular Optimization,bivariate constraint system,lexicographic optimization problem
Journal
32
Issue
ISSN
Citations 
3
0364-765X
1
PageRank 
References 
Authors
0.35
11
1
Name
Order
Citations
PageRank
J. S. Pang16616.31