Výsledky vyhľadávania - Sum of nonconvex function AND composite functions

Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning Autor Le Thi, Hoai An, Le, Hoai Minh, Phan, Duy Nhat, Tran, Bach

“…•We address the problem of minimizing the sum of a nonconvex, differentiable function and composite functions by DC…”
Získať plný text

A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems Autor Liang, Jiaming, Monteiro, Renato D. C., Sim, Chee-Khian

“…) variants to solve a smooth nonconvex composite optimization problem whose objective function is the sum of a nonconvex differentiable function f with a Lipschitz continuous gradient and a simple…”
Získať plný text

Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems Autor Wang, Tanxing, Jiang, Yaning, Cai, Xingju

“…In this paper, we propose two quasi-Newton type proximal gradient methods for a class of nonconvex nonsmooth composite optimization problems, where the objective function is the sum of a smooth…”
Získať plný text

The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization Autor Aragón-Artacho, Francisco J., Pérez-Aros, Pedro, Torregrosa-Belén, David

“… nonsmooth and nonconvex mathematical programs expressed as sums and differences of composite functions…”
Získať plný text

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions Autor Pham, Tan Nhat, Dao, Minh N., Eberhard, Andrew, Sultanova, Nargiz

“… is the separable sum of possibly nonconvex nonsmooth functions and a smooth function, coupled by a difference of functions…”
Získať plný text

A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems Autor Pang, Liping, Wang, Xiaoliang, Meng, Fanyun

“… The composite problem considered here is the sum of two functions: one is convex and the other is nonconvex…”
Získať plný text

Doubly relaxed forward-Douglas–Rachford splitting for the sum of two nonconvex and a DC function Autor Dao, Minh N., Pham, Tan Nhat, Tung, Phan Thanh

“…In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is expressed in a difference-of-convex (DC) form…”
Získať plný text

Globalized inexact proximal Newton-type methods for nonconvex composite functions Autor Kanzow, Christian, Lechner, Theresa

“…Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term…”
Získať plný text

A fast computational Gauss–Seidel type iPALM algorithm using an incremental aggregated gradient strategy for weakly convex composite optimization problems with application in image processing Autor Jia, Zehui, Hou, Junru, Dong, Ping, Liu, Zhiyu

“…) for solving a class of nonconvex and nonsmooth composite optimization problems, whose objective function is the sum of a finite number of smooth nonconvex functions and nonsmooth weakly convex functions…”
Získať plný text

An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization Autor Wang, Xiaoliang, Pang, Liping, Wu, Qi, Zhang, Mingkun

“… The composite problems are the sum of a finite convex function with inexact information and a nonconvex function…”
Získať plný text

Inexact proximal DC Newton-type method for nonconvex composite functions Autor Nakayama, Shummin, Narushima, Yasushi, Yabe, Hiroshi

“…We consider a class of difference-of-convex (DC) optimization problems where the objective function is the sum of a smooth function and a possibly nonsmooth DC function…”
Získať plný text

MOCCA: Mirrored Convex/Concave Optimization for Nonconvex Composite Functions Autor Barber, Rina Foygel, Sidky, Emil Y

“…Many optimization problems arising in high-dimensional statistics decompose naturally into a sum of several terms, where the individual terms are relatively simple but the composite objective function…”
Zistit podrobnosti o prístupe

Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator Autor Liu, Yuncheng, Xia, Fuquan

“…In this paper, we consider a class of three-composite nonconvex nonsmooth optimization problems, where one of nonsmooth functions is further composed with linear operator…”
Získať plný text

An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems Autor Ge, Zhili, Wu, Zhongming, Zhang, Xin, Ni, Qin

“…We consider a class of problems where the objective function is the sum of a smooth function and a composition of nonconvex and nonsmooth functions…”
Získať plný text

Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions Autor Nakayama, Shummin, Narushima, Yasushi, Yabe, Hiroshi

“…This study considers a proximal Newton-type method to solve the minimization of a composite function that is the sum of a smooth nonconvex function and a nonsmooth convex function…”
Získať plný text

A Bregman inertial forward-reflected-backward method for nonconvex minimization Autor Wang, Xianfu, Wang, Ziyuan

“…We propose a Bregman inertial forward-reflected-backward (BiFRB) method for nonconvex composite problems…”
Získať plný text

A hybrid stochastic alternating direction method of multipliers for nonconvex and nonsmooth composite optimization Autor Zeng, Yuxuan, Bai, Jianchao, Wang, Shengjia, Wang, Zhiguo, Shen, Xiaojing

“…•Comparison experiments demonstrate the efficiency of the algorithm. Nonconvex and nonsmooth composite optimization problems with linear constraints have gained significant attention in practical applications…”
Získať plný text

Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization Autor Li, Xue, Bian, Wei

“…) algorithm and a Bregman randomized block-coordinate proximal gradient (B-RBCPG) algorithm for minimizing the sum of two nonconvex nonsmooth functions, one of which is block separable…”
Získať plný text

An accelerated mirror descent algorithm for constrained nonconvex problems Autor Gao, Xue, Jiang, Yaning, Cai, Xingju, Wang, Kai

Získať plný text

On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization Autor Milzarek, Andre, Xiao, Xiantao, Wen, Zaiwen, Ulbrich, Michael

“…In this work, we present probabilistic local convergence results for a stochastic semismooth Newton method for a class of stochastic composite optimization problems involving the sum of smooth…”
Získať plný text