Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets characteristics of feasible sets of semi-infinite programming (SIP)
problems. They can be used for the formulation
THE IMPACT OF SELECTIVE CONVEXITY ON THE STRUCTURES OF PRODUCTION FUNCTIONS IN DATA ENVELOPMENT ANALYSIS at the same time. The production possibility set (PPS) of the DEA models is
convex, and the PPS of the FDH
The Closure and the Interior of C-convex SetsC-
convexity of the closure, interiors and their lineal
convexity are considered for C-
convex sets
Dual Decomposition Methods for Nonlinear Resource Allocation Problems in Telecommunication Networks convex optimization
problem involving two kinds of constraints. By using the dual Lagrangian method
Exact penalties for decomposable convex optimization problemsWe consider a general decomposable
convex optimization
problem. By using right-hand side allocation
Solution method for monotone mixed variational inequalities regularization and a descent technique over a gap (merit) function. The same uniformly
convex auxiliary function
A Non-monotone Conjugate Subgradient Type Method for Minimization of Convex Functions subgradient type method without any line search for minimization of
convex non-differentiable functions
Duality for equilibrium problems under generalized monotonicityDuality is studied for an abstract equilibrium
problem which includes, among others, optimization
On Lagrange duality theory for dynamics vaccination games strong duality between a
convex optimization
problem connected with the management of vaccinations