国家自然科学基金(s11331012)

作品数：5被引量：14H指数：2
导出分析报告
相关期刊：《Frontiers of Information Technology & Electronic Engineering》《Acta Mathematica Sinica,English Series》《Journal of the Operations Research Society of China》更多>>
相关主题：FIRST-ORDERMANIFOLDHMSOPTIMIZATIONSECOND-ORDER更多>>
相关领域：理学自动化与计算机技术更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
A Brief Introduction to Manifold Optimization被引量：8
《Journal of the Operations Research Society of China》2020年第2期199-248,共50页Jiang Hu Xin Liu Zai-Wen Wen Ya-Xiang Yuan 
Xin Liu’s research was supported in part by the National Natural Science Foundation of China(No.11971466);Key Research Program of Frontier Sciences,Chinese Academy of Sciences(No.ZDBS-LY-7022);the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences and the Youth Innovation Promotion Association,CAS.Zai-Wen Wen’s research was supported in part by the the National Natural Science Foundation of China(Nos.11421101 and 11831002);the Beijing Academy of Artificial Intelligence.Ya-Xiang Yuan’s research was supported in part by the National Natural Science Foundation of China(Nos.11331012 and 11461161005).
Manifold optimization is ubiquitous in computational and appliedmathematics,statistics,engineering,machine learning,physics,chemistry,etc.One of the main challenges usually is the non-convexity of the manifold constra...
关键词：Convergence First-order-type algorithms Manifold optimization RETRACTION Second-order-type algorithms 
A Partial First-Order Affine-Scaling Method被引量：2
《Acta Mathematica Sinica,English Series》2019年第1期1-16,共16页Ran GU Ya Xiang YUAN 
supported by NSFC(Grant Nos.11331012 and 11461161005)
We present a partial first-order affine-scaling method for solving smooth optimization with linear inequality constraints. At each iteration, the algorithm considers a subset of the constraints to reduce the complexit...
关键词：Linear INEQUALITY constraints AFFINE SCALING INTERIOR point 
Deep learning compact binary codes for fingerprint indexing被引量：1
《Frontiers of Information Technology & Electronic Engineering》2018年第9期1112-1123,共12页Chao-chao BAI Wei-qiang WANG Tong ZHAO Ru-xin WANG Ming-qiang LI 
supported by the National Natural Science Foundation of China(Nos.11331012,11571014,and 11731013)
With the rapid growth in fingerprint databases, it has become necessary to develop excellent fingerprint indexing to achieve efficiency and accuracy. Fingerprint indexing has been widely studied with real-valued featu...
关键词：Fingerprint indexing Minutia cylinder code Deep neural network Multi-index hashing 
An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions被引量：1
《Journal of the Operations Research Society of China》2016年第2期167-191,共25页Ya-Feng Liu Rui Diao Feng Ye Hong-Wei Liu 
the National Natural Science Foundation of China(Nos.11331012 and 11301516).
In this paper,we consider the problem of computing the smallest enclosing ball(SEB)of a set of m balls in Rn,where the product mn is large.We first approximate the non-differentiable SEB problem by its log-exponentia...
关键词：Smallest enclosing ball Smoothing approximation Inexact gradient Inexact Newton-CG algorithm Global convergence 
A Parallel Line Search Subspace Correction Method for Composite Convex Optimization被引量：2
《Journal of the Operations Research Society of China》2015年第2期163-187,共25页Qian Dong Xin Liu Zai-Wen Wen Ya-Xiang Yuan 
Qian Dong was supported in part by the National Natural Science Foundation of China(Nos.11331012,11321061 and 11461161005);Xin Liu was supported in part by the National Natural Science Foundation of China(Nos.11101409,11331012,11471325 and 11461161005);China 863 Program(No.2013AA122902);the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences;Zai-Wen Wen was supported in part by the National Natural Science Foundation of China(Nos.11322109 and 91330202);Ya-Xiang Yuan was supported in part by the National Natural Science Foundation of China(Nos.11331012,11321061 and 11461161005).
In this paper,we investigate a parallel subspace correction framework for composite convex optimization.The variables are first divided into a few blocks based on certain rules.At each iteration,the algorithms solve a...
关键词：Line search Block coordinate descent method Domain decomposition Jacobian-type iteration Distributed optimization 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部