Results 41 to 50 of about 166,468,241 (292)

Robust Face Super-Resolution via Locality-Constrained Low-Rank Representation

open access: yesIEEE Access, 2017
Learning-based face super-resolution relies on obtaining accurate a priori knowledge from the training data. Representation-based approaches (e.g., sparse representation-based and neighbor embedding-based schemes) decompose the input images using ...
Tao Lu   +4 more
doaj   +1 more source

A Proximal Alternating Direction Method of Multipliers with a Substitution Procedure [PDF]

open access: yesMathematical Problems in Engineering, 2020
In this paper, we considers the separable convex programming problem with linear constraints. Its objective function is the sum of m individual blocks with nonoverlapping variables and each block consists of two functions: one is smooth convex and the other one is convex.
Miantao Chao   +2 more
openaire   +2 more sources

A Flexible Stochastic Multi-Agent ADMM Method for Large-Scale Distributed Optimization

open access: yesIEEE Access, 2022
While applying stochastic alternating direction method of multiplier (ADMM) methods has become enormously potential in distributed applications, improving the algorithmic flexibility can bring huge benefits.
Lin Wu, Yongbin Wang, Tuo Shi
doaj   +1 more source

On Convergence Rates of Proximal Alternating Direction Method of Multipliers

open access: yesJournal of Scientific Computing, 2023
AbstractIn this paper we consider from two different aspects the proximal alternating direction method of multipliers (ADMM) in Hilbert spaces. We first consider the application of the proximal ADMM to solve well-posed linearly constrained two-block separable convex minimization problems in Hilbert spaces and obtain new and improved non-ergodic ...
openaire   +5 more sources

Alternating direction method of multiplier for the unilateral contact problem with an automatic penalty parameter selection

open access: yes, 2019
International audienceWe propose an alternating direction method of multiplier (ADMM) for the unilateral (frictionless) contact problem with an optimal parameter selection.
Chorfi, Amina, Koko, Jonas
core   +1 more source

An Efficient Augmented Lagrangian Method for Statistical X-Ray CT Image Reconstruction. [PDF]

open access: yesPLoS ONE, 2015
Statistical iterative reconstruction (SIR) for X-ray computed tomography (CT) under the penalized weighted least-squares criteria can yield significant gains over conventional analytical reconstruction from the noisy measurement.
Jiaojiao Li   +8 more
doaj   +1 more source

Weighted Sum Secrecy Rate Maximization for Joint ITS- and IRS-Empowered System

open access: yesEntropy, 2023
In this work, we investigate a novel intelligent surface-assisted multiuser multiple-input single-output multiple-eavesdropper (MU-MISOME) secure communication network where an intelligent reflecting surface (IRS) is deployed to enhance the secrecy ...
Shaochuan Yang   +4 more
doaj   +1 more source

Scalable Stochastic Alternating Direction Method of Multipliers

open access: yesCoRR, 2015
Stochastic alternating direction method of multipliers (ADMM), which visits only one sample or a mini-batch of samples each time, has recently been proved to achieve better performance than batch ADMM. However, most stochastic methods can only achieve a convergence rate $O(1/\sqrt T)$ on general convex problems,where T is the number of iterations ...
Shen-Yi Zhao, Wu-Jun Li, Zhi-Hua Zhou
openaire   +2 more sources

Optimization study of high-dimensional varying coefficient partially linear model based on elastic network

open access: yesEngineering Science and Technology, an International Journal
In this paper, we study the high-dimensional varying coefficient partially linear model and proposes a variable parameter selection method combined with elastic network.
Mengmeng Zhao   +4 more
doaj   +1 more source

Fast Stochastic Alternating Direction Method of Multipliers

open access: yesCoRR, 2013
In this paper, we propose a new stochastic alternating direction method of multipliers (ADMM) algorithm, which incrementally approximates the full gradient in the linearized ADMM formulation. Besides having a low per-iteration complexity as existing stochastic ADMM algorithms, the proposed algorithm improves the convergence rate on convex problems from
Leon Wenliang Zhong, James T. Kwok
openaire   +3 more sources

Home - About - Disclaimer - Privacy