Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang. Non-convex min-max optimization: Provable algorithms and applications in machine learning. arXiv preprint arXiv:1810.02060, 2018.H. Rafique, M. Liu, Q. Lin, and T. Yang, "Non-convex min- max optimization: Provable algorithms and ...
We consider minimization of stochastic functionals that are compositions of a (potentially) non-smooth convex function $h$ and smooth function $c$. We deve... John C. Duchi,R Feng - 《Siam Journal on Optimization》 被引量: 40发表: 2017年 Stochastic Frank-Wolfe Methods for Nonconvex Optimiza...
Ideal, weakly efficient solutions for vector optimization problemsconvex vector optimizationideal solutionweakly efficient solutionefficient solutionrecession functionrecession coneconvex analysisWe establish existence results for finite dimensional vector minimization problems allowing the solution set to be unbounded...
The best-known complexity for black box subgradient optimization for weakly convex functions is O(ϵ−4). This result is proved for stochastic subgradient in [22], but as in the convex case, there is no known improvement in the deterministic setting. As in convex optimization, subgradient ...
Solving (most) of a set of quadratic equalities: Composite optimization\n for robust phase retrieval We develop procedures, based on minimization of the composition $f(x) =h(c(x))$ of a convex function $h$ and smooth function $c$, for solving randomcollect... Duchi John C,R Feng - ...
Automatic segmentation of neonatal images using convex optimization and coupled level sets NeuroImage, 48 (3) (2011), pp. 805-817 View PDFView articleView in ScopusGoogle Scholar [16] X. Wang, X. Deng, Q. Fu, Q. Zhou, J. Feng, H. Ma, W. Liu, C. Zheng A weakly-supervised framew...
Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificatorsIn this note, by making use of the concept of unbounded approximate Hessian matrices, we present second order optimality conditions for a constrained mathematical ...
Biconvex sets and optimization with biconvex functions: a survey and extensions The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for......
Under the conditions of Partial ic-convexlike Maps,optimality necessary conditions ofweak efficient solutions for vector optimization problems with equality and inequality constraints are obtained. 在部分生成锥内部凸-锥-凸映射下,得到了既有等式约束又有不等式约束的向量优化问题弱有效解的最优性必要条件。
The weakly logarithmically convex (concave) functions and their properties 来自 知网 喜欢 0 阅读量: 61 作者: QG Sun 摘要: Aim To discuss the weakly logarithmically convex(concave) functions and their properties.Methods The analytical and mathematical induction methods are used.Results Some ...