PRIMAL-DUAL

作品数：37被引量：41H指数：3
导出分析报告
相关领域：理学更多>>
相关作者：刘黎黎汪定伟王西恩更多>>
相关机构：中国人民解放军陆军炮兵防空兵学院东北大学云南大学南京理工大学更多>>
相关期刊：《Science China Mathematics》《Journal of Computational Mathematics》《IEEE/CAA Journal of Automatica Sinica》《Frontiers of Computer Science》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金江西省自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers
《Tsinghua Science and Technology》2024年第6期1694-1702,共9页Hang Luo Lu Han Tianping Shuai Fengmin Wang 
supported by the Beijing Municipal Natural Science Foundation(No.Z220004);the National Natural Science Foundation of China(Nos.12371321,12171051,and 12171052);the Research Innovation Fund for College Students of Beijing University of Posts and Telecommunications.
In this paper,we propose the Priority Facility Location Problem with Outliers(PFLPO),which is a generalization of both the Facility Location Problem with Outliers(FLPO)and Priority Facility Location Problem(PFLP).As o...
关键词：priority facility location PRIMAL-DUAL approximation algorithm 
Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems被引量：1
《IEEE/CAA Journal of Automatica Sinica》2024年第6期1485-1498,共14页You Zhao Xing He Mingliang Zhou Tingwen Huang 
supported by the National Natural Science Foundation of China(62176218,62176027);the Fundamental Research Funds for the Central Universities(XDJK2020TY003);the Funds for Chongqing Talent Plan(cstc2024ycjh-bgzxm0082)。
The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on...
关键词：Accelerated projection neurodynamic approach lin-ear and set constraints projection operators smooth and nonsmooth convex optimization time scaling. 
Distributed accelerated primal-dual neurodynamic approaches for resource allocation problem
《Science China(Technological Sciences)》2023年第12期3639-3650,共12页ZHAO You HE Xing YU JunZhi HUANG TingWen 
supported by the National Natural Science Foundation of China (Grant No.62176218);the Fundamental Research Funds for the Central Universities (Grant No.XDJK2020TY003)。
This paper investigates two distributed accelerated primal-dual neurodynamic approaches over undirected connected graphs for resource allocation problems(RAP)where the objective functions are generally convex.With the...
关键词：accelerated primal-dual neurodynamic approaches RAP projection operators penalty method convergence rate O(1/(t^(2))) 
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties被引量：1
《Frontiers of Computer Science》2023年第3期125-132,共8页Xiaofei LIU Weidong LI Jinhua YANG 
The work was supported in part by the National Natural Science Foundation of China(Grant No.12071417)。
In this paper,we consider the-prize-collecting minimum vertex cover problem with submodular penalties,which generalizes the well-known minimum vertex cover problem,minimum partial vertex cover problem and minimum vert...
关键词：vertex cover k-prize-collecting PRIMAL-DUAL approximation algorithm 
Primal-Dual ε-Subgradient Method for Distributed Optimization
《Journal of Systems Science & Complexity》2023年第2期577-590,共14页ZHU Kui TANG Yutao 
supported by the National Natural Science Foundation of China under Grant No.61973043。
This paper studies the distributed optimization problem when the objective functions might be nondifferentiable and subject to heterogeneous set constraints.Unlike existing subgradient methods,the authors focus on the...
关键词：Constrained optimization distributed optimization e-subgradient primal-dual dynamics 
An Approximation Algorithm for P-prize-collecting Set Cover Problem
《Journal of the Operations Research Society of China》2023年第1期207-217,共11页Jin-Shuang Guo Wen Liu Bo Hou 
This work was supported by the National Natural Science Foundation of China(No.11971146);the Natural Science Foundation of Hebei Province of China(Nos.A2019205089 and A2019205092);Hebei Province Foundation for Returnees(No.CL201714);Overseas Expertise Introduction Program of Hebei Auspices(No.25305008).
In this paper,we consider the P-prize-collecting set cover(P-PCSC)problem,which is a generalization of the set cover problem.In this problem,we are given a set system(U,S),where U is a ground set and S⊆2U is a collect...
关键词：P-prize-collecting set cover problem Approximation algorithm PRIMAL-DUAL Lagrangian relaxation 
PRIMAL-DUAL PATH-FOLLOWING METHODS AND THE TRUST-REGION UPDATING STRATEGY FOR LINEAR PROGRAMMING WITH NOISY DATA被引量：1
《Journal of Computational Mathematics》2022年第5期756-776,共21页Xinlong Luo Yiyan Yao 
This work was supported in part by Grant 61876199 from National Natural Science Foundation of China,Grant YBWL2011085 from Huawei Technologies Co.,Ltd.,and Grant YJCB2011003HI;Innovation Research Program of Huawei Technologies Co.,Ltd..The first author is grateful to professor Li-Zhi Liao for introducing him the interiorpoint methods when he visited Hong Kong Baptist University in July,2012.
In this article,we consider the primal-dual path-following method and the trust-region updating strategy for the standard linear programming problem.For the rank-deficient problem with the small noisy data,we also giv...
关键词：Continuation Newton method Trust-region method Linear programming Rank deficiency Path-following method Noisy data. 
A Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization被引量：4
《IEEE/CAA Journal of Automatica Sinica》2022年第5期812-833,共22页Xinlei Yi Shengjun Zhang Tao Yang Tianyou Chai Karl Henrik Johansson 
supported by the Knut and Alice Wallenberg Foundation;the Swedish Foundation for Strategic Research;the Swedish Research Council;the National Natural Science Foundation of China(62133003,61991403,61991404,61991400)。
The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of...
关键词：Distributed nonconvex optimization linear speedup Polyak-Lojasiewicz(P-L)condition primal-dual algorithm stochastic gradient descent 
Exponential Convergence of Primal-Dual Dynamical System for Linear Constrained Optimization被引量：1
《IEEE/CAA Journal of Automatica Sinica》2022年第4期745-748,共4页Luyao Guo Xinli Shi Jinde Cao 
Dear editor,Primal-dual dynamics(PDD)and its variants are prominent first-order continuous-time algorithms to determine the primal and dual solutions of a constrained optimization problem(COP).Due to the simple struct...
关键词：Primal OPTIMIZATION CONVERGENCE 
Collaborative Distributed AC Optimal Power Flow: A Dual Decomposition Based Algorithm被引量：1
《Journal of Modern Power Systems and Clean Energy》2021年第6期1414-1423,共10页Zheyuan Cheng Mo-Yuen Chow 
supported by the National Science Foundation (No. CNS-1505633)。
We propose a dual decomposition based algorithm that solves the AC optimal power flow(ACOPF) problem in the radial distribution systems and microgrids in a collaborative and distributed manner. The proposed algorithm ...
关键词：Distributed convex optimization distributed en-ergy management system optimal power flow primal-dual de-composition 
全选清除导出
共4页<1234>
检索报告 对象比较 聚类工具 使用帮助 返回顶部