搜索结果: 1-10 共查到“primal-dual”相关记录10条 . 查询时间(0.034 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints
耦合 线性约束 非光滑 非凸极小问题 基本对偶交替 近端梯度算法
2023/4/14
Nonconvex minimax problems have attracted wide attention in machine learning, signal processing and many other fields in recent years. In this paper, we propose a primal dual alternating proximal grad...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Linear Convergence of a Primal-dual Algorithm for Multi-agent Interval Optimization
多智能体 区间优化 原对偶算法 线性收敛
2023/4/21
In this talk, we consider a distributed interval optimization problem (DIOP) with uncertainties, whose global function is formed by local convex interval functions. In seeking Pareto solutions for dis...
A primal-dual potential reduction method for problems involving matrix inequalities
Interior point algorithms Linear matrix inequaliües Semidefinite programming
2015/8/11
We describe a potential reduction method for convex optimization problems involving matrix inequalities. The method is based on the theory developed by Nesterov and Nemirovsky and generalizes Gonzaga ...
Robust optimal control of linear discrete-time systems using primal-dual interior-point methods
Robust control application model linear discrete
2015/8/11
This paper describes how to efficiently solve a robust optimal control problem using recently developed primal-dual interior-point methods. Among potential applications are model predictive control. T...
A primal-dual operator splitting method for conic optimization
Character segmentation conic optimization yield distributed linear algebra
2015/8/7
We develop a simple operator splitting method for solving a primal conic optimization problem; we show that the iterates also solve the dual problem. The resulting algorithm is very simple to describe...
A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities
Interior point algorithms Linear matrix inequaliües Semidefinite programming
2015/7/13
We describe a potential reduction method for convex optimization problems involving matrix inequalities. The method is based on the theory developed by Nesterov and Nemirovsky and generalizes Gonzaga ...
Robust Optimal Control of Linear Discrete-Time Systems Using Primal-Dual Interior-Point Methods
Robust Optimal Control Linear Discrete-Time Systems Primal-Dual Interior-Point Methods
2015/7/10
This paper describes how to efficiently solve a robust optimal control problem using recently developed primal-dual interior-point methods. Among potential applications are model predictive control. T...
A Primal-Dual Operator Splitting Method for Conic Optimization
Primal-Dual Operator Splitting Method Conic Optimization
2015/7/9
We develop a simple operator splitting method for solving a primal conic optimization problem; we show that the iterates also solve the dual problem. The resulting algorithm is very simple to describe...
Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum monotone operators
maximal monotone operator monotone inclusion nonsmooth convex optimization parallel sum set-valued duality splitting algorithm
2011/8/22
Abstract: We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An ...
Primal-dual distance bounds of linear codes with application to cryptography
Boolean function dual distance linear code minimum distance
2009/2/13
Let N(d, d⊥) denote the minimum length n of a
linear code C with d and d⊥, where d is the minimum Hamming
distance of C and d⊥ is the minimum Hamming distance of C⊥.
In this paper, we show a lower ...