发布求助
文献互助 智能选刊 最新文献

Optimization Methods & Software最新文献

筛选
英文 中文
Sequential hierarchical least-squares programming for prioritized non-linear optimal control 优先非线性优化控制的顺序分层最小二乘编程
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-02-08 DOI: 10.1080/10556788.2024.2307467
Kai Pfeiffer, Abderrahmane Kheddar
{"title":"Sequential hierarchical least-squares programming for prioritized non-linear optimal control","authors":"Kai Pfeiffer, Abderrahmane Kheddar","doi":"10.1080/10556788.2024.2307467","DOIUrl":"https://doi.org/10.1080/10556788.2024.2307467","url":null,"abstract":"We present a sequential hierarchical least-squares programming solver with trust-region and hierarchical step-filter with application to prioritized discrete non-linear optimal control. It is based...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140025743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Three-operator reflected forward-backward splitting algorithm with double inertial effects 具有双重惯性效应的三操作器反射式前向后分算法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2024.2307470
Qiao-Li Dong, Min Su, Yekini Shehu
{"title":"Three-operator reflected forward-backward splitting algorithm with double inertial effects","authors":"Qiao-Li Dong, Min Su, Yekini Shehu","doi":"10.1080/10556788.2024.2307470","DOIUrl":"https://doi.org/10.1080/10556788.2024.2307470","url":null,"abstract":"In this paper, we propose a reflected forward-backward splitting algorithm with two different inertial extrapolations to find a zero of the sum of three monotone operators consisting of the maximal...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139763317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal inexactness schedules for tunable oracle-based methods 基于甲骨文的可调方法的最佳不精确性时间表
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2023.2296982
Guillaume Van Dessel, François Glineur
{"title":"Optimal inexactness schedules for tunable oracle-based methods","authors":"Guillaume Van Dessel, François Glineur","doi":"10.1080/10556788.2023.2296982","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296982","url":null,"abstract":"Several recent works address the impact of inexact oracles in the convergence analysis of modern first-order optimization techniques, e.g. Bregman Proximal Gradient and Prox-Linear methods as well ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140025908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimized convergence of stochastic gradient descent by weighted averaging 通过加权平均优化随机梯度下降的收敛性
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2024.2306383
Melinda Hagedorn, Florian Jarre
{"title":"Optimized convergence of stochastic gradient descent by weighted averaging","authors":"Melinda Hagedorn, Florian Jarre","doi":"10.1080/10556788.2024.2306383","DOIUrl":"https://doi.org/10.1080/10556788.2024.2306383","url":null,"abstract":"Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optimal solution. Howev...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140025919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods 用于最小化凸函数梯度规范的近优张量方法和加速原始双张量方法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2023.2296443
Pavel Dvurechensky, Petr Ostroukhov, Alexander Gasnikov, César A. Uribe, Anastasiya Ivanova
{"title":"Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods","authors":"Pavel Dvurechensky, Petr Ostroukhov, Alexander Gasnikov, César A. Uribe, Anastasiya Ivanova","doi":"10.1080/10556788.2023.2296443","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296443","url":null,"abstract":"Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective has Lipschitz pth...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139763761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem 求解非凸、非光滑、有限和优化问题的增量准牛顿算法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-01-28 DOI: 10.1080/10556788.2023.2296432
Gulcin Dinc Yalcin, Frank E. Curtis
{"title":"Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem","authors":"Gulcin Dinc Yalcin, Frank E. Curtis","doi":"10.1080/10556788.2023.2296432","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296432","url":null,"abstract":"Algorithms for solving certain nonconvex, nonsmooth, finite-sum optimization problems are proposed and tested. In particular, the algorithms are proposed and tested in the context of a transductive...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139678470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Shape-changing trust-region methods using multipoint symmetric secant matrices 利用多点对称正割矩阵改变信任区域形状的方法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-01-24 DOI: 10.1080/10556788.2023.2296441
J. J. Brust, J. B. Erway, R. F. Marcia
{"title":"Shape-changing trust-region methods using multipoint symmetric secant matrices","authors":"J. J. Brust, J. B. Erway, R. F. Marcia","doi":"10.1080/10556788.2023.2296441","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296441","url":null,"abstract":"In this work, we consider methods for large-scale and nonconvex unconstrained optimization. We propose a new trust-region method whose subproblem is defined using a so-called ‘shape-changing’ norm ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139585072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Predicting pairwise interaction affinities with ℓ0-penalized least squares–a nonsmooth bi-objective optimization based approach* 用 ℓ0 惩罚最小二乘法预测配对相互作用亲和力--基于非平滑双目标优化的方法*
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-01-24 DOI: 10.1080/10556788.2023.2280784
Pauliina Paasivirta, Riikka Numminen, Antti Airola, Napsu Karmitsa, Tapio Pahikkala
{"title":"Predicting pairwise interaction affinities with ℓ0-penalized least squares–a nonsmooth bi-objective optimization based approach*","authors":"Pauliina Paasivirta, Riikka Numminen, Antti Airola, Napsu Karmitsa, Tapio Pahikkala","doi":"10.1080/10556788.2023.2280784","DOIUrl":"https://doi.org/10.1080/10556788.2023.2280784","url":null,"abstract":"In this paper, we introduce a novel nonsmooth optimization-based method LMBM-Kronℓ0LS for solving large-scale pairwise interaction affinity prediction problems. The aim of LMBM-Kronℓ0LS is to produ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ1-regularized problems 用于 ℓ1-regularized 问题的近似梯度方案中的 Barzilai-Borwein 类规则
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-01-24 DOI: 10.1080/10556788.2023.2285489
Serena Crisci, Simone Rebegoldi, Gerardo Toraldo, Marco Viola
{"title":"Barzilai–Borwein-like rules in proximal gradient schemes for ℓ1-regularized problems","authors":"Serena Crisci, Simone Rebegoldi, Gerardo Toraldo, Marco Viola","doi":"10.1080/10556788.2023.2285489","DOIUrl":"https://doi.org/10.1080/10556788.2023.2285489","url":null,"abstract":"We propose a novel steplength selection rule in proximal gradient methods for minimizing the sum of a differentiable function plus an ℓ1-norm penalty term. The proposed rule modifies one of the cla...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139585077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decentralized saddle point problems via non-Euclidean mirror prox 通过非欧几里得镜像近似解决分散鞍点问题
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2024-01-24 DOI: 10.1080/10556788.2023.2280062
Alexander Rogozin, Aleksandr Beznosikov, Darina Dvinskikh, Dmitry Kovalev, Pavel Dvurechensky, Alexander Gasnikov
{"title":"Decentralized saddle point problems via non-Euclidean mirror prox","authors":"Alexander Rogozin, Aleksandr Beznosikov, Darina Dvinskikh, Dmitry Kovalev, Pavel Dvurechensky, Alexander Gasnikov","doi":"10.1080/10556788.2023.2280062","DOIUrl":"https://doi.org/10.1080/10556788.2023.2280062","url":null,"abstract":"We consider smooth convex-concave saddle point problems in the decentralized distributed setting, where a finite-sum objective is distributed among the nodes of a computational network. At each nod...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139763209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信