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

Optimization Methods & Software最新文献

筛选
英文 中文
Mixed linear and semidefinite programming for combinatorial and quadratic optimization 组合优化和二次优化的混合线性和半定规划
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805761
S. Benson, Yinyu Yeb, Xiong Zhang
{"title":"Mixed linear and semidefinite programming for combinatorial and quadratic optimization","authors":"S. Benson, Yinyu Yeb, Xiong Zhang","doi":"10.1080/10556789908805761","DOIUrl":"https://doi.org/10.1080/10556789908805761","url":null,"abstract":"We use the semidefinite relaxation to approximate combinatorial and quadratic optimization problems subject to linear, quadratic, as well as boolean constraints. We present a dual potential reduction algorithm and show how to exploit the sparse structure of various problems. Coupled with randomized and heuristic methods, we report computational results for approximating graph-partition and quadratic problems with dimensions 800 to 10,000. This finding, to the best of our knowledge, is the first computational evidence of the effectiveness of these approximation algorithms for solving large-scale problems.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"82 1","pages":"515-544"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75844956","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}
引用次数: 50
Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming 将Mehrotra和gonzio高阶方法推广到混合半定二次线性规划
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805748
J. Haeberly, M. V. Nayakkankuppam, M. Overton
{"title":"Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming","authors":"J. Haeberly, M. V. Nayakkankuppam, M. Overton","doi":"10.1080/10556789908805748","DOIUrl":"https://doi.org/10.1080/10556789908805748","url":null,"abstract":"We discuss extensions of Mehrotra's higher order corrections scheme and Gondzio's multiple centrality corrections scheme to mixed semidefinite-quadratic-linear programming (SQLP). These extensions have been included in a solver for SQLP written in C and based on LAPACK. The code implements a primal-dual path-following algorithm for solving SQLP problems based on the XZ + ZX search direction and Mehrotra's predictor-corrector method. We present benchmarks showing that the use of the higher order schemes yields substantial reductions in both the number of iterations and the running time of the algorithm, and also improves its robustness.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"4 1","pages":"67-90"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84222341","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}
引用次数: 10
Sensitivity analysis of ODEs and DAEs — theory and implementation guide ODEs和DAEs的敏感性分析——理论与实施指南
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805742
M. Kiehl
{"title":"Sensitivity analysis of ODEs and DAEs — theory and implementation guide","authors":"M. Kiehl","doi":"10.1080/10556789908805742","DOIUrl":"https://doi.org/10.1080/10556789908805742","url":null,"abstract":"The solution y(t,t 0,y 0) of an initial-value problem (IVP)[ydot](t)=f(t,y,p) with initial value y(t 0)=y 0 at a point t is a differentiable function of the initial value y 0 and the parameter vector p, provided f y and f p are continuous. The computation of y(t,t 0,y 0) and the sensitivity matrix play an important role in the efficient numerical solution of boundary-value problems, optimal-control problems and for parameter identification in dynamical systems. There is a wide variety of algorithms for the solution of IVPs but till now, there are just a few efficient implementations for the computation of , which is the even more important part. Here a number of implementations are introduced, treating non-stiff, stiff and differential algebraic equations. The basic new idea is to regard the numerical approximation of as the solution of the variational differential equation of a linearised IVP with approximation of the linear right-hand side by the difference quotient of the original non-linear f. For fur...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"10 1","pages":"803-821"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89618027","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}
引用次数: 15
User'S guide To Lipsol linear-programming interior point solvers V0.4 Lipsol线性规划内部点求解器V0.4的用户指南
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805756
Yin Zhang
{"title":"User'S guide To Lipsol linear-programming interior point solvers V0.4","authors":"Yin Zhang","doi":"10.1080/10556789908805756","DOIUrl":"https://doi.org/10.1080/10556789908805756","url":null,"abstract":"LIPSOL stands for Linear programming Interior-Point SOLvers. It is a free, Matlab-based software package for solving linear programs by interior-Point methods. It requires Matlab version 4.0 or later to run. The current release of LIPSOL is for 32-bit UNIX platforms. LIPSOL is designed to solve relatively large problems. It utilizes Matlab’s sparse-matrix data-structure and Application Program Interface facility, and at the same time takes advantages of existing, efficient Fortran codes for solving large, sparse, symmetric positive definite linear systems. Specifically, LIPSOL constructs MEX-files from two Fortran packages: a sparse Cholesky factorization package developed by Esmond Ng and Barry Peyton at ORNL and a multiple minimum-degree ordering package by Joseph Liu at University of Waterloo . Built in the high-level programming environment of Matlab, LIPSOL enjoys a much greater degree of simplicity and versatility than codes in Fortran or C language. On the other hand, utilizing efficient Fortran codes for computationally intensive tasks, LIPSOL also has adequate speed for solving moderately large-scale problems even in the presence of overhead","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"34 1","pages":"385-396"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79054252","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}
引用次数: 42
Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming 半定规划的齐次内点算法的Matlab实现
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805763
Nathan W. Brixius, F. Potra, Rongqin Sheng
{"title":"Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming","authors":"Nathan W. Brixius, F. Potra, Rongqin Sheng","doi":"10.1080/10556789908805763","DOIUrl":"https://doi.org/10.1080/10556789908805763","url":null,"abstract":"Mehrotra type primal-dual predictor-corrector interior-point algorithms for semidefinite programming are implemented, using the homogeneous formulation proposed and analyzed by Potra and Sheng. Several search directions, including the AHO, HKM, NT, Toh, and Gu directions, are used. A rank-2 update technique is employed in our MATLAB code so that the computation of homogeneous directions is only slightly more expensive than in the non-homogeneous case. However, the homogeneous algorithms generally take fewer iterations to compute an approximate solution within a desired accuracy. Numerical results show that the homogeneous algorithms outperform their non-homogeneous counterparts, with improvement of more than 20% in many cases, in terms of total CPU time.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"136 1","pages":"583-596"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77469119","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}
引用次数: 34
The BPMPD interior point solver for convex quadratic problems 凸二次问题的BPMPD内点求解器
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805758
C. Mészáros
{"title":"The BPMPD interior point solver for convex quadratic problems","authors":"C. Mészáros","doi":"10.1080/10556789908805758","DOIUrl":"https://doi.org/10.1080/10556789908805758","url":null,"abstract":"The paper describes the convex quadratic solver BPMPD Version 2.21. The solver is based on the infeasible–primal–dual algorithm extended by the predictor–corrector and target–following techniques. The discussion includes topics related to the implemented algorithm and numerical algebra employed. We outline the presolve, scaling and starting point stategies used in BPMPD, and special attention is given for sparsity and stability issues. Computational results are given on a demonstrative set of convex quadratic problems.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"36 1","pages":"431-449"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72681176","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}
引用次数: 85
CSDP, A C library for semidefinite programming 半确定编程的C语言库
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805765
B. Borchers
{"title":"CSDP, A C library for semidefinite programming","authors":"B. Borchers","doi":"10.1080/10556789908805765","DOIUrl":"https://doi.org/10.1080/10556789908805765","url":null,"abstract":"This paper describes CSDP, a library of routines that implements a predictor corrector variant of the semidefinite programming algorithm of Helmberg, Rendl, Vanderbei, and Wolkowicz. The main advantages of this code are that it can be used as a stand alone solver or as a callable subroutine, that it is written in C for efficiency, that it makes effective use of sparsity in the constraint matrices, and that it includes support for linear inequality constraints in addition to linear equality constraints. We discuss the algorithm used, its computational complexity, and storage requirements. Finally, we present benchmark results for a collection of test problems.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"43 1","pages":"613-623"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74440368","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}
引用次数: 604
Homogeneous Analytic Center Cutting Plane Methods with Approximate Centers 具有近似中心的齐次解析中心切割平面方法
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805753
Y. Nesterov, Olivier Péton, J. Vial
{"title":"Homogeneous Analytic Center Cutting Plane Methods with Approximate Centers","authors":"Y. Nesterov, Olivier Péton, J. Vial","doi":"10.1080/10556789908805753","DOIUrl":"https://doi.org/10.1080/10556789908805753","url":null,"abstract":"In this paper we consider a homogeneous analytic center cutting plane method in a projective space. We describe a general scheme that uses a homogeneous oracle and computes an approximate analytic center at each iteration. This technique is applied to a convex feasibility problem, to variational inequalities, and to convex constrained minimization. We prove that these problems can be solved with the same order of complexity as in the case of exact analytic centers. For the feasibility and the minimization problems rough approximations suffice, but very high precision is required for the variational inequalities. We give an example of variational inequality where even the first analytic center needs to be computed with a precision matching the precision required for the solution.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"21 1","pages":"243-273"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81796223","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}
引用次数: 11
PCx: an interior-point code for linear programming 线性规划的内点代码
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805757
J. Czyzyk, Sanjay Mehrotra, M. Wagner, Stephen J. Wright
{"title":"PCx: an interior-point code for linear programming","authors":"J. Czyzyk, Sanjay Mehrotra, M. Wagner, Stephen J. Wright","doi":"10.1080/10556789908805757","DOIUrl":"https://doi.org/10.1080/10556789908805757","url":null,"abstract":"We describe the code PCx, a primal-dual interior-point code for linear programming. Information is given about problem formulation and the underlying algorithm, along with instructions for installing, invoking, and using the code. Computational results on standard test problems are reported.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"22 1","pages":"397-430"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74889630","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}
引用次数: 91
A repository of convex quadratic programming problems 一个存储库的凸二次规划问题
IF 2.2 3区 数学
Optimization Methods & Software Pub Date : 1999-01-01 DOI: 10.1080/10556789908805768
I. Maros, C. Mészáros
{"title":"A repository of convex quadratic programming problems","authors":"I. Maros, C. Mészáros","doi":"10.1080/10556789908805768","DOIUrl":"https://doi.org/10.1080/10556789908805768","url":null,"abstract":"The introduction of a standard set of linear programming problems, to be found in NETLIB/-LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming. The research community is somewhat troubled by the lack of a standard format for defining a QP problem and also by the lack of a standard reference set of problems for purposes similar to that of LP. In the paper we propose a standard format and announce the availability of a test set of collected 138 QP problems.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"106 1","pages":"671-681"},"PeriodicalIF":2.2,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76222935","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}
引用次数: 127
首页 上一页 下一页 尾页
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学术官方微信