内容提示: Disciplined Convex-Concave ProgrammingXinyue Shen Steven Diamond Yuantao Gu Stephen BoydApril 12, 2016AbstractIn this paper we introduce disciplined convex-concave programming (DCCP), whichcombines the ideas of disciplined convex programming (DCP) with convex-concave pro-gramming (CCP). ...
Xu L. One-bit-matching ICA theorem, convex-concave programming, and combinatorial optimization. In: Advances in neural networks: ISNN 2005, LNCS 3496. Berlin: Springer-Verlag, 2005, 5–20Xu L. One-bit-matching ICA theorem, convex-concave pro- gramming, and combinatorial optimization. In: ...
A problem satisfies the rules of disciplined convex-concave programming (DCCP) if it has the form minimize/maximize o(x) subject to l_i(x) ~ r_i(x), i=1,...,m, whereo(the objective),l_i(left-hand sides), andr_i(right-hand sides) are expressions (functions in the variablex) ...
Linear Programming Norm Inner Product Minima and Maxima Convex Set Affine Set Convex Hull Caratheodory Theorem Weierstrass Theorem Closest Point Theorem Fundamental Separation Theorem Convex Cones Polar Cone Conic Combination Polyhedral Set Extreme point of a convex set Direction Convex & Concave Function Je...
Programming, 31 (1985), pp. 339–347. Google Scholar E. R. Hansen, Global Optimization using Interval Analysis, Marcel Dekker, New York, 1992. Google Scholar G. Heindl, A representation of the interval hull of a tolerance polyhedron describing inclusions of function values and slopes, ...
Convex-concave saddle point problemsDuality and decomposition schemesConic and semidefinite programmingWe propose new interior projection type methods for solving ... A Auslender,M Teboulle - 《Mathematical Programming》 被引量: 143发表: 2005年 Variations and extension of the convex–concave procedure We...
Decomposition methods for finding saddle points of a function φ:X × Y → ℝ are characterized by an alternating succession of master programs and subprograms [7]. The master programs determine the proper iteration points, which are approximate saddle points over a subset Xn× Ynof the origina...
The picture shows part of the cone, and a slice (at ). 而在socp中,是将线性函数变成了仿射函数(Second-order cone programming (SOCP) is a generalization of智能推荐ZooKeeper源代码研究(一) 去年在工作中使用了ZooKeeper进行配置管理,今年准备进一步使用ZooKeeper,因此对其的源代码进行一下研究,也学习一下...
Le Thi, H. A., and Pham Dinh, T. (2018), “DC Programming and DCA: Thirty Years of Developments,”Mathematical Programming. A Publication of the Mathematical Programming Society, 169, 5–68. DOI: 10.1007/s10107-018-1235-y. Web of Science ®Google Scholar ...
After we obtain the vertices of the convex-concave hull, ℬ(X) = V𝒞ℋ(X)∪ V𝒩𝒞ℋ(X), these points are sent to train the SVM classifier, that is, to find an optimal hyperplane or to solve the following quadratic programming problem (primal problem): (3.11) where ξk ...