Sign Up to like & get recommendations! 1
Published in 2018 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2018.11.431
Abstract: Abstract The paper addresses the nonconvex nonsmooth optimization problem with the cost function and equality and inequality constraints given by d.c. functions. The original problem is reduced to a problem without constraints with the help… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "IEEE/CAA Journal of Automatica Sinica"
DOI: 10.1109/jas.2022.105554
Abstract: 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 many… read more here.
Sign Up to like & get recommendations! 0
Published in 2021 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2021.3108501
Abstract: This paper considers the distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of local cost functions by using local information exchange. We first propose a distributed first-order primal-dual algorithm.… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2021.3115430
Abstract: This article examines the distributed nonconvex optimization problem with structured nonconvex objective functions and coupled convex inequality constraints on static networks. A distributed continuous-time primal-dual algorithm is proposed to solve the problem. We use the… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3165627
Abstract: In this article, we propose a novel solution for nonconvex problems of multiple variables, especially for those typically solved by an alternating minimization (AM) strategy that splits the original optimization problem into a set of… read more here.
Sign Up to like & get recommendations! 1
Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3220806
Abstract: For nonconvex optimization problems, a routine is to assume that there is no perturbation when executing the solution task. Nevertheless, dealing with the perturbation in advance may increase the burden on the system and take… read more here.
Sign Up to like & get recommendations! 0
Published in 2017 at "IEEE Transactions on Signal Processing"
DOI: 10.1109/tsp.2016.2637317
Abstract: In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints, and also consider extensions to some structured, nonsmooth problems. The algorithm solves… read more here.
Sign Up to like & get recommendations! 0
Published in 2017 at "Anziam Journal"
DOI: 10.21914/anziamj.v58i0.11874
Abstract: Zero duality gap for nonconvex optimization problems requires the use of a generalized Lagrangian function in the definition of the dual problem. We analyze the situation in which the original problem is associated with a… read more here.