Dual approach for a class of implicit convex optimization problems as a generalization of a
convex optimization problem under arbitrary right-hand side constraint
On e-subgradient methods of non-differentiable optimizationOn e-subgradient methods of non-differentiable
optimization A splitting bundle approach for non-smooth non-convex minimizationA splitting bundle approach for non-smooth non-
convex minimization
Dual approach for a class of implicit convex optimization problems as a generalization of a
convex optimization problem under arbitrary right-hand side constraint
A Method of Local Convex Majorants for Solving Variational-Like InequalitiesA Method of Local
Convex Majorants for Solving Variational-Like Inequalities
An Approximate Penalty Method with Descent for Convex Optimization Problems© 2019, Allerton Press, Inc. We propose a penalty method for general
convex constrained
Extremality of convex sets with some applicationsIn this paper we introduce an enhanced notion of extremal systems for sets in locally
convex