TEOREMA COINCIDENCE UNTUK PEMETAAN-PEMETAAN DALAM KOLEKSI S-KKM PADA RUANG KONVEKS-G by , TIKU TANDIANGNGA, S.Si, , Dr. Ch. Rini Indrati, M.Si.

“…Furthermore, by the coincidence theorem, we will search the intersection between a set y+C and a range of multi-valued mapping having the S-KKM property at y, where C is convex subset and for some y is element of a nonempty convex subset of locally convex topological vector spaces.…”

An analysis of the Spekkens toy theory with connection to Wootters discrete phase space by Aliakbarzadeh, Mojtaba, Zainuddin, Hishamuddin

“…Noting that MUB basis vectors are obtained by eigenstates of generalized Pauli operators, the MUB basis vectors are thus the set of stabilizer states. Galvao has characterized the set of states with non-negative Wigner function class; they form the convex hull of the stabilizer states used as the MUB basis vectors. …”
Get full text

Enhancing robustness of air transportation network by Yang, Changpeng

“…First considered is the flight route selection problem, in which a set of routes is chosen from a set of candidate routes to minimize the total effective resistance of the network. …”
Get full text

TEOREMA PALEY-WIENER-SCHWARTZ PADA DOMAIN NON KONVEKS by , CYNTHIA TRI OCTAVIANTI, , Dr. Ch. Rini Indrati, M.Si.

“…Also we discuss the theorem of Paley-Wiener-Schwartz generated by the set of convex-d.…”

Algorithms for recovery of sparse signals in compressed sensing by Tran, Anh Vu.

“…The ultimate comparison is between the convex optimization of the regularized basis pursuit and Compressive Sampling Matching Pursuit.…”
Get full text

Human posture detection for video surveillance by Jin, Tao

“…Convex shape modeling aims to generate convex shapes that can be the candidatures for human head and torso. …”
Get full text

Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems by Zeng, Xianlin, Yi, Peng, Hong, Yiguang, Xie, Lihua

“…This paper studies distributed algorithms for the nonsmooth extended monotropic optimization problem, which is a general convex optimization problem with a certain separable structure. …”
Get full text
Get full text

Computationally efficient and scalable optimization approaches for integrated energy management systems by Dan, Mainak

“…The solutions of these set of problems are then used to warm-start a hybrid meta-heuristic algorithm (named as CE-mGA) that exhaustively searches various scenarios in the presence of non-linear and non-convex constraints. …”
Get full text

Dissimilarity-based semi-supervised subset selection by Lei, Yiran

“…To begin with, the subset selection problem is treated as an convex optimization process with regularization. Thus the wanted subset is modeled as an unknown sparse matrix, which non-zero rows represent the target set by the source set. …”
Get full text

On a class of simultaneous pursuit games. by Ibragimov, Gafurjan I., Satimov, Numan

“…Let A and B be given convex closed bounded nonempty subsets in a Hilbert space H; let the first player choose points in the set A and let the second one do those in the set B. …”
Get full text

On pure phases of the Vannimenus model by Ganikhodjaev, Nasir, Uguz, Selman, Akin, Hasan, Temir, Seyit

“…It is well known that such measures form a nonempty convex compact subset in the set of all probabilistic measures. …”
Get full text

Application of Optimization Methods for Solving Clustering and Classification Problems by Shabanzadeh, Parvaneh

“…Next the problem of data classification is studied as a problem of global, non-smooth and non-convex optimization; this approach consists of describing clusters for the given training sets. …”
Get full text

On pure phases of the Vannimenus model by Ganikhodjaev, Nasir, Uguz, Selman, Akin, Hasan, Temir, Seyit

“…It is well known that such measures form a nonempty convex compact subset in the set of all probabilistic measures. …”
Get full text

Shape fitting problems in the presence of outliers by Guo, Zhengyang

“…We let n denote the size of the input point set and t the number of possible outliers. With the target to cover no less than (n − t) points of the input, we consider the minimum number of unit disks, a parallelogram of minimum area and a convex polygon of minimum area. …”
Get full text

Some construction methods of aggregation operators in decision-making problems: an overview by Khameneh, Azadeh Zahedi, Kilicman, Adem

“…The purpose of aggregation methods is to convert a list of objects, all belonging to a given set, into a single representative object of the same set usually by an n-ary function, so-called aggregation operator. …”
Get full text

On extreme Gibbs measures of the Vannimenus model by Ganikhodjaev, Nasir, Akin, Hasan, Uguz, Selman, Temir, Seyit

“…It is well known that such measures form a nonempty convex compact subset in the set of all probability measures. …”
Get full text

Optimized dynamic policy for robust receding horizon control by Ajay Gautam

“…Essentially, the proposed policy incorporates all the 'uncertain' information into the controller dynamics and this reduces the conservativeness in the assessment of feasible control inputs and hence the feasible invariant set for the controlled system. Furthermore, this policy allows the control optimization problem to be split into two separate problems: one to determine the convex hull of the controller matrices and the other to compute the controller initial state. …”
Get full text

Phase diagram and extreme Gibbs measures of the Ising model on a Cayley tree in the presence of competing binary and ternary interactions by Ganikhodjaev, Nasir, Akin, Hasan, Temir, Seyit, Uguz, Selman

“…It is well known that such measures form a nonempty convex compact subset in the set of all probability measures. …”
Get full text

Implementability of social choice functions by Yu, Lan

“…The set of implementable functions is enriched when we allow assumptions on the center's ability to verify agents' inputs. …”
Get full text

Distributed resource allocation algorithm design and its application to economic dispatch in smart grids by Bai, Lu

“…It addresses how to economically assign the available resources to a set of users such that the overall objective is optimized. …”
Get full text