По вашему запросу найдено документов: 74986
Страница 1 из 7499
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
Dual approach for a class of implicit convex optimization problems as a generalization of a convex optimization problem under arbitrary right-hand side constraint
Optimality conditions for convex semi-infinite programming problems with finitely representable compact index setsIn the present paper, we analyze a class of convex semi-infinite programming problems
An Approximate Penalty Method with Descent for Convex Optimization Problems optimization problems, where each auxiliary penalized problem is solved approximately with a special composite
Phenomenon of Immobility in study of convex Optimization problemsWe are concerned with convex problems of infinite Optimization, namely problems of convex Semi
Exact penalties for decomposable convex optimization problemsWe consider a general decomposable convex optimization problem. By using right-hand side allocation
Decentralized multi-agent optimization based on a penalty methodWe propose a decentralized penalty method for general convex constrained multi-agent optimization
On a constructive approach to optimality conditions for convex SIP problems with polyhedral index setsIn the paper, we consider a problem of convex Semi-Infinite Programming with an infinite index set
Duality for equilibrium problems under generalized monotonicityDuality is studied for an abstract equilibrium problem which includes, among others, optimization
Страница 1 из 7499
Фасеты
Партнеры
Индексация
