Investigated Non-Conic Model for Constrained Optimization
نویسندگان
چکیده
منابع مشابه
Towards non-symmetric conic optimization
In this paper we propose a new interior-point method, which is based on an extension of the ideas of self-scaled optimization to the general cases. We suggest using the primal correction process to find a scaling point. This point is used to compute a strictly feasible primal-dual pair by simple projection. Then, we define an affine-scaling direction and perform a prediction step. This is the o...
متن کاملA primal-dual method for conic constrained distributed optimization problems
We consider cooperative multi-agent consensus optimization problems over an undirected network of agents, where only those agents connected by an edge can directly communicate. The objective is to minimize the sum of agentspecific composite convex functions over agent-specific private conic constraint sets; hence, the optimal consensus decision should lie in the intersection of these private se...
متن کاملA Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model
We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic qua...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملA non-heuristic distributed algorithm for non- convex constrained optimization
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization problems where the cost function is expressed as a sum of functions, and where each function is associated to an agent. In addition, the agents can have equality constraints as well. The a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics
سال: 2008
ISSN: 2311-7990
DOI: 10.33899/csmj.2008.163980