Suchergebnisse - Sum of nonconvex function AND composite functions

Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions

Autoren: Shummin, Nakayama Yasushi, Narushima Hiroshi, Yabe

Index Begriffe: Nonsmooth optimization, Proximal Newton-type method, Inexact proximal method, Memoryless quasi-Newton method, Broyden family, Global and local convergence properties, Journal Article, AM

URL: http://id.nii.ac.jp/1438/00010241/
https://uec.repo.nii.ac.jp/?action=repository_action_common_download&item_id=10335&item_no=1&attribute_id=22&file_no=1
https://doi.org/10.1007/s10589-021-00264-9
https://doi.org/10.1007/s10589-021-00264-9

Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning

Autoren: Le Thi, Hoai An Le, Hoai Minh Phan, Duy Nhat et al.

Weitere Verfasser: Le Thi, Hoai An Le, Hoai Minh Phan, Duy Nhat et al.

Quelle: ISSN: 0096-3003 ; Applied Mathematics and Computation ; https://hal.univ-lorraine.fr/hal-03565125 ; Applied Mathematics and Computation, 2021, 409, pp.125904. ⟨10.1016/j.amc.2020.125904⟩.

Schlagwörter: DC programming, DCA, DCA-like, Accelerated DCA, Accelerated DCA-like, Sum of nonconvex function and composite functions, Dimensionality reduction, T-SNE, [INFO]Computer Science [cs]

Verfügbarkeit: https://hal.univ-lorraine.fr/hal-03565125
https://hal.univ-lorraine.fr/hal-03565125v1/document
https://hal.univ-lorraine.fr/hal-03565125v1/file/S0096300320308572.pdf
https://doi.org/10.1016/j.amc.2020.125904

Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions.

Autoren: Yasushi, Narushima Hiroshi, Yabe Shummin, Nakayama

Index Begriffe: Nonsmooth optimization, Proximal Newton-type method, Inexact proximal method, Memoryless quasi-Newton method, Broyden family, Global and local convergence properties, Journal Article., AM.

URL: http://id.nii.ac.jp/1438/00010241/
https://doi.org/10.1007/s10589-021-00264-9
https://uec.repo.nii.ac.jp/?action=repository_action_common_download&item_id=10335&item_no=1&attribute_id=22&file_no=1

Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions

Autoren: Shummin Nakayama Yasushi Narushima Hiroshi Yabe

Quelle: Computational Optimization and Applications. 79:127-154

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://keio.pure.elsevier.com/ja/publications/inexact-proximal-memoryless-quasi-newton-methods-based-on-the-bro
https://doi.org/10.1007/s10589-021-00264-9
https://link.springer.com/article/10.1007/s10589-021-00264-9
https://tus.elsevierpure.com/ja/publications/inexact-proximal-memoryless-quasi-newton-methods-based-on-the-bro
https://ideas.repec.org/a/spr/coopap/v79y2021i1d10.1007_s10589-021-00264-9.html

VARIABLE METRIC FORWARD-BACKWARD ALGORITHM FOR COMPOSITE MINIMIZATION PROBLEMS.

Autoren: REPETTI, AUDREY WIAUX, YVES

Quelle: SIAM Journal on Optimization; 2021, Vol. 31 Issue 2, p1215-1241, 27p

Schlagwörter: FORWARD-backward algorithm, DIFFERENTIABLE functions, OPERATOR functions, IMAGE processing, NONSMOOTH optimization

The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization

Autoren: Universidad de Alicante. Departamento de Matemáticas Aragón Artacho, Francisco Javier Pérez-Aros, Pedro et al.

Index Begriffe: Nonconvex optimization, Difference programming, Kurdyka–Łojasiewicz property, Descent lemma, Minimum-sum of squares clustering, Heron’s problem, info:eu-repo/semantics/article

URL: http://hdl.handle.net/10045/152382
https://doi.org/10.1007/s10107-024-02190-0
https://doi.org/10.1007/s10107-024-02190-0
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-097960-B-C22
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/PID2022-136399NB-C21

Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions.

Autoren: Nakayama, Shummin Narushima, Yasushi Yabe, Hiroshi

Quelle: Computational Optimization & Applications; May2021, Vol. 79 Issue 1, p127-154, 28p

Schlagwörter: SMOOTHNESS of functions, HESSIAN matrices, CONVEX functions, QUASI-Newton methods, NONSMOOTH optimization

COMPLEXITY OF FINITE-SUM OPTIMIZATION WITH NONSMOOTH COMPOSITE FUNCTIONS AND NON-LIPSCHITZ REGULARIZATION.

Autoren: XIAO WANG XIAOJUN CHEN

Quelle: SIAM Journal on Optimization. 2024, Vol. 34 Issue 3, p2472-2502. 31p.

Schlagwörter: *PROBLEM solving, *PROBABILITY theory, *ALGORITHMS, CONTINUOUS functions, NONSMOOTH optimization

Inexact proximal DC Newton-type method for nonconvex composite functions.

Autoren: Nakayama, Shummin Narushima, Yasushi Yabe, Hiroshi

Quelle: Computational Optimization & Applications. Mar2024, Vol. 87 Issue 2, p611-640. 30p.

Schlagwörter: NEWTON-Raphson method, SMOOTHNESS of functions, QUASI-Newton methods, NONSMOOTH optimization, EQUATIONS

The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization.

Autoren: Aragón-Artacho, Francisco J. Pérez-Aros, Pedro Torregrosa-Belén, David

Quelle: Mathematical Programming. Nov2025, Vol. 214 Issue 1/2, p491-537. 47p.

Schlagwörter: *MATHEMATICAL optimization, NONSMOOTH optimization, SUBGRADIENT methods, MATHEMATICAL functions

Globalized inexact proximal Newton-type methods for nonconvex composite functions.

Autoren: Kanzow, Christian Lechner, Theresa

Quelle: Computational Optimization & Applications. Mar2021, Vol. 78 Issue 2, p377-410. 34p.

Schlagwörter: NEWTON-Raphson method, QUASI-Newton methods, GENERALIZATION, NONSMOOTH optimization

Gradient methods for minimizing composite functions

Autoren: UCL - SSH/IMMAQ/CORE - Center for operations research and econometrics UCL - SST/ICTM/INMA - Pôle en ingénierie mathématique Nesterov, Yurii

Quelle: Mathematical Programming, Vol. Online first (2013)

Index Begriffe: info:eu-repo/semantics/article

URL: http://hdl.handle.net/2078.1/121611

Adaptive Accelerated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization

Autoren: Yuan, Ganzhao

Index Begriffe: Mathematics - Optimization and Control, Computer Science - Computer Vision and Pattern Recognition, Mathematics - Numerical Analysis, text

URL: http://arxiv.org/abs/2502.21099

BREGMAN PROXIMAL ALGORITHMS FOR COMPOSITE AND FINITE-SUM NONCONVEX MINIMIZATION PROBLEMS

Autoren: Themelis, Andreas Latafat, Puya Ahookhosh, Masoud et al.

Index Begriffe: Presentation

URL: http://hdl.handle.net/2324/6790349
https://catalog.lib.kyushu-u.ac.jp/opac_download_md/6790349/6790349.pdf

BREGMAN PROXIMAL ALGORITHMS FOR COMPOSITE AND FINITE-SUM NONCONVEX MINIMIZATION PROBLEMS.

Autoren: Themelis, Andreas Latafat, Puya Ahookhosh, Masoud et al.

Index Begriffe: Presentation.

URL: https://hdl.handle.net/2324/6790349
https://catalog.lib.kyushu-u.ac.jp/opac_download_md/6790349/6790349.pdf

A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima

Autoren: Ahookhosh, Masoud Themelis, Andreas Patrinos, Panagiotis

Index Begriffe: Nonsmooth nonconvex optimization, Bregman-Moreau and Bregman forward-backward envelopes, relative smoothness, KL inequality, nonlinear error bound, nonisolated local minima, superlinear convergence, Journal Article, VoR

URL: http://hdl.handle.net/2324/4399979
https://catalog.lib.kyushu-u.ac.jp/opac_download_md/4399979/4399979.pdf
https://doi.org/10.1137/19M1264783
https://doi.org/10.1137/19M1264783

Convex composite wavelet frame and total variation-based image deblurring using nonconvex penalty functions.

Autoren: Zhengwei Shen Lishuang Cheng

Quelle: Journal of Electronic Imaging; Sep/Oct2017, Vol. 26 Issue 5, p1-15, 15p

Schlagwörter: IMAGE quality analysis, WAVELET transforms, SPLIT Bregman method, COMPUTATIONAL complexity, IMAGE reconstruction

Empirical risk minimization for risk-neutral composite optimal control with applications to bang-bang control

Autoren: Milz, Johannes Walter, Daniel

Index Begriffe: Mathematics - Optimization and Control, Mathematics - Numerical Analysis, 90C15, 90C59, 90C06, 35Q93, 49M41, 90C60, text

URL: http://arxiv.org/abs/2408.10384

Linesearch-Enhanced Forward-Backward Methods for Inexact Nonconvex Scenarios.

Autoren: Bonettini, Silvia Franchini, Giorgia Pezzi, Danilo et al.

Quelle: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 2, p1314-1343, 40p

An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization

Autoren: Xiaoliang Wang Liping Pang Qi Wu et al.

Quelle: Mathematics, Vol 9, Iss 8, p 874 (2021)

Schlagwörter: nonconvex and nonsmooth, inexact oracles, disaggregate strategy, proximal bundle method, convexification technology, DC problems, Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2227-7390/9/8/874; https://doaj.org/toc/2227-7390

Zugangs-URL: https://doaj.org/article/32fbee5cfbfe4cb892712bc94bc24dee