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

Optimization Methods & Software最新文献

筛选
英文 中文
Proximal extrapolated gradient methods for variational inequalities. 变分不等式的近端外推梯度方法。
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2017-03-21 eCollection Date: 2018-01-01 DOI: 10.1080/10556788.2017.1300899
Yu Malitsky
{"title":"Proximal extrapolated gradient methods for variational inequalities.","authors":"Yu Malitsky","doi":"10.1080/10556788.2017.1300899","DOIUrl":"https://doi.org/10.1080/10556788.2017.1300899","url":null,"abstract":"<p><p>The paper concerns with novel first-order methods for monotone variational inequalities. They use a very simple linesearch procedure that takes into account a local information of the operator. Also, the methods do not require Lipschitz continuity of the operator and the linesearch procedure uses only values of the operator. Moreover, when the operator is affine our linesearch becomes very simple, namely, it needs only simple vector-vector operations. For all our methods, we establish the ergodic convergence rate. In addition, we modify one of the proposed methods for the case of a composite minimization. Preliminary results from numerical experiments are quite promising.</p>","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2017-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10556788.2017.1300899","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35749421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 53
Enhanced Bounding Techniques to Reduce the Protein Conformational Search Space. 减少蛋白质构象搜索空间的增强边界技术。
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 2009-08-01 DOI: 10.1080/10556780902753486
Scott R McAllister, Christodoulos A Floudas
{"title":"Enhanced Bounding Techniques to Reduce the Protein Conformational Search Space.","authors":"Scott R McAllister,&nbsp;Christodoulos A Floudas","doi":"10.1080/10556780902753486","DOIUrl":"10.1080/10556780902753486","url":null,"abstract":"<p><p>The complexity and enormous size of the conformational space that must be explored for the protein tertiary structure prediction problem has led to the development of a wide assortment of algorithmic approaches. In this study, we apply state-of-the-art tertiary structure prediction algorithms and instead focus on the development of bounding techniques to reduce the conformational search space. Dihedral angle bounds on the ϕ and ψ angles are established based on the predicted secondary structure and studies of the allowed regions of ϕ/ψ space. Distance bounds are developed based on predicted secondary structure information (including β-sheet topology predictions) to further reduce the search space. This bounding strategy is entirely independent of the degree of homology between the target protein and the database of proteins with experimentally-determined structures. The proposed approach is applied to the structure prediction of protein G as an illustrative example, yielding a significantly higher number of near-native protein tertiary structure predictions.</p>","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10556780902753486","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29127166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A dual parameterization approach to linear-quadratic semi-infinite programming problems 线性二次半无限规划问题的对偶参数化方法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805725
Y. Liu, K. Teo, S. Ito
{"title":"A dual parameterization approach to linear-quadratic semi-infinite programming problems","authors":"Y. Liu, K. Teo, S. Ito","doi":"10.1080/10556789908805725","DOIUrl":"https://doi.org/10.1080/10556789908805725","url":null,"abstract":"Semi-infinite programming problems are special optimization problems in which a cost is to be minimized subject to infinitely many constraints. This class of problems has many real-world applications. In this paper, we consider a class of linear-quadratic semi-infinite programming problems. Using the duality theory, the dual problem is obtained, where the decision variables are measures. A new parameterization scheme is developed for approximating these measures. On this bases, an efficient algorithm for computing the solution of the dual problem is obtained. Rigorous convergence results are given to support the algorithm. The solution of the primal problem is easily obtained from that of the dual problem. For illustration, three numerical examples are included.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73826043","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}
引用次数: 13
A combined relaxation method for decomposable variational inequalities 可分解变分不等式的组合松弛法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805735
I. Konnov
{"title":"A combined relaxation method for decomposable variational inequalities","authors":"I. Konnov","doi":"10.1080/10556789908805735","DOIUrl":"https://doi.org/10.1080/10556789908805735","url":null,"abstract":"An iterative method based on combining, modifying and generalizing different relaxation subgradient methods is proposed for solving variational inequality problems. For certain structured problems this method leads to a decomposition scheme. Convergence of the method is proved under weak assumptions. In particular, the main mapping need not be single-valued or monotone.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86688053","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}
引用次数: 9
Computing Wardropian equilibria in a complementarity framework 互补框架下的衣柜均衡计算
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805733
M. Ferris, A. Meeraus, T. Rutherford
{"title":"Computing Wardropian equilibria in a complementarity framework","authors":"M. Ferris, A. Meeraus, T. Rutherford","doi":"10.1080/10556789908805733","DOIUrl":"https://doi.org/10.1080/10556789908805733","url":null,"abstract":"This note considers alternative methods for computing Wadropian (traffic network) equilibria using a multicommodity formulation in nonlinear program and complementarity formats. These methods compute exact equilibria, they are efficient and they can be implemented with standard modeling software.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86786696","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}
引用次数: 45
A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming 半定规划中Nesterov-Todd和Kojima-Shindoh-hara搜索方向的注释
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805746
M. Kojima, M. Shida, Susumu Shindoh
{"title":"A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming","authors":"M. Kojima, M. Shida, Susumu Shindoh","doi":"10.1080/10556789908805746","DOIUrl":"https://doi.org/10.1080/10556789908805746","url":null,"abstract":"This short note shows that the Nesterov-Todd search direction used in primal-dual interior-point methods for semidefinite programs belongs to the family of search directions proposed by Kojima, Shindoh and Hara.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76615856","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}
引用次数: 17
Regularized Symmetric Indefinite Systems in Interior Point Methods for Linear and Quadratic Optimization 正则对称不定系统的线性和二次优化的内点法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805754
A. Altman, J. Gondzio
{"title":"Regularized Symmetric Indefinite Systems in Interior Point Methods for Linear and Quadratic Optimization","authors":"A. Altman, J. Gondzio","doi":"10.1080/10556789908805754","DOIUrl":"https://doi.org/10.1080/10556789908805754","url":null,"abstract":"This paper presents linear algebra techniques used in the implementation of an interior point method for solving linear programs and convex quadratic programs with linear constraint. The new regularization techniques for Newton equation system applicable to both symmetric positive definite and symmetric indefinite systems are described. They transform the latter to quasidefinite systems known to be strongly factorizable to a form of Cholesky-like factorization.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89911255","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}
引用次数: 178
A study of search directions in primal-dual interior-point methods for semidefinite programming 半定规划中原始-对偶内点法搜索方向的研究
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805745
M. Todd
{"title":"A study of search directions in primal-dual interior-point methods for semidefinite programming","authors":"M. Todd","doi":"10.1080/10556789908805745","DOIUrl":"https://doi.org/10.1080/10556789908805745","url":null,"abstract":"We discuss several different search directions which can be used in primal-dual interior-point methods for semidefinite programming problems and investigate their theoretical properties, including scale invariance, primal-dual symmetry, and whether they always generate well-defined directions. Among the directions satisfying all but at most two of these desirable properties are the Alizadeh-Haeberly-Overton, Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-HaralMonteiro, Nesterov-Todd, Gu, and Toh directions, as well as directions we will call the MTW and Half directions. The first five of these appear to be the best in our limited computational testing also.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86344479","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}
引用次数: 122
A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function 利用D-gap函数求解盒约束变分等式问题的约瑟夫-牛顿混合方法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805734
Jiming Peng, Christian Kanzowb, M. Fukushima
{"title":"A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function","authors":"Jiming Peng, Christian Kanzowb, M. Fukushima","doi":"10.1080/10556789908805734","DOIUrl":"https://doi.org/10.1080/10556789908805734","url":null,"abstract":"A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the affine variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78661892","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}
引用次数: 17
On self-concordant convex–concave functions 关于自调和凸凹函数
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805755
A. Nemirovski
{"title":"On self-concordant convex–concave functions","authors":"A. Nemirovski","doi":"10.1080/10556789908805755","DOIUrl":"https://doi.org/10.1080/10556789908805755","url":null,"abstract":"In this paper, we introduce the notion of a self-concordant convex-concave function, establish basic properties of these functions and develop a path-following interior point method for approximating saddle points of “sufficiently well-behaved” convex-concave functions—those which admit natural self-concordant convex-concave regularizations. The approach is illustrated by its applications to developing an exterior penalty polynomial time method for Semidefinite Programming and to the problem of inscribing the largest volume ellipsoid into a given polytope.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76998946","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术官方微信