Výsledky vyhľadávania - "reverse convex programming problem"

An inner approximation method incorporating with a penalty function method for a reverse convex programming problem

Autori: Masahiro Inuiguchi Syuuji Yamada Tetsuzo Tanino

Zdroj: Journal of Computational and Applied Mathematics. 146:57-75

Predmety: Convex programming, numerical examples, Inner approximation method, Reverse convex programming problem, global optimization, dual problem, penalty function method, Applied Mathematics, Dual problem, 01 natural sciences, Penalty function method, global convergence, Computational Mathematics, Numerical mathematical programming methods, inner approximation method, reverse convex programming problem, Global optimization, 0101 mathematics

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1801718
https://doi.org/10.1016/s0377-0427(02)00418-1
https://www.sciencedirect.com/science/article/pii/S0377042702004181
https://www.sciencedirect.com/science/article/abs/pii/S0377042702004181#!
https://ui.adsabs.harvard.edu/abs/2002JCoAM.146...57Y/abstract

A Cutting Plane Algorithm for Linear Reverse Convex Programs: A cutting plane algorithm for linear reverse convex programs

Autori: Khosrow Moshirvaziri Mahyar A. Amouzegar

Zdroj: Annals of Operations Research. 105:201-212

Predmety: 0209 industrial biotechnology, global optimization, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, reverse convex programming problem, 02 engineering and technology, Nonconvex programming, global optimization, nonconvex programming, cutting plane techniques

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1723354
https://doi.org/10.1023/a:1013361800945
https://EconPapers.repec.org/RePEc:spr:annopr:v:105:y:2001:i:1:p:201-212:10.1023/a:1013361800945
https://ideas.repec.org/a/spr/annopr/v105y2001i1p201-21210.1023-a1013361800945.html
https://link.springer.com/content/pdf/10.1023/A:1013361800945.pdf
https://www.rand.org/pubs/external_publications/EP20010036.html
https://link.springer.com/article/10.1023/A%3A1013361800945

D.C.計画問題に対する逆凸制約の緩和について / Relaxation of reverse convex constraints to a D.C. programming problem

Autori: Syuuji Yamada Tamaki Tanaka Tetsuzo Tanino a ďalší

Zdroj: Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers. 2005, :28

An Inner Approximation Method for a Reverse Convex Programming Problem

Autori: Syuuji Yamada Tetsuzo Tanino Masahiro Inuiguchi a ďalší

Prispievatelia: Syuuji Yamada Tetsuzo Tanino Masahiro Inuiguchi a ďalší

Zdroj: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1114-10.pdf.

Predmety: Global Optimization, Reverse Convex Programming Problem, Dual Prob- lem, Inner Approximation Method, Penalty Function Method

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.497.3314

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.497.3314
http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1114-10.pdf

逆凸計画問題に対する内部近似法の正確なペナルティパラメータ ; An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem

Autori: Yamada, Syuuji 166396 Tanino, Tetsuzo a ďalší

Predmety: Global Optimization, Reverse Convex Programming Problem, Inner Approximation Method, Penalty Function Method, Exact Penalty Parameter

Popis súboru: application/pdf

Relation: http://ci.nii.ac.jp/naid/110000038939; 富山短期大学紀要; 36; 165; 181; AA11519009; http://hdl.handle.net/10191/26270

Dostupnosť: https://niigata-u.repo.nii.ac.jp/record/29527/files/110000038939.pdf
http://hdl.handle.net/10191/26270
https://niigata-u.repo.nii.ac.jp/records/29527

An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem.

Additional Titles: Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem

Autori: Tanino, Tetsuzo Inuiguchi, Masahiro Yamada, Syuuji

Témy: Global Optimization, Reverse Convex Programming Problem, Inner Approximation Method, Penalty Function Method, Exact Penalty Parameter, Departmental Bulletin Paper.

URL: http://hdl.handle.net/10191/26270
https://niigata-u.repo.nii.ac.jp/records/29527
http://ci.nii.ac.jp/naid/110000038939
https://niigata-u.repo.nii.ac.jp/record/29527/files/110000038939.pdf

Additional Titles: An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem
An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem

Autori: Yamada, Syuuji 166396 Tanino, Tetsuzo a ďalší

Témy: Global Optimization, Reverse Convex Programming Problem, Inner Approximation Method, Penalty Function Method, Exact Penalty Parameter

URL: https://niigata-u.repo.nii.ac.jp/record/29527/files/110000038939.pdf
http://hdl.handle.net/10191/26270
https://niigata-u.repo.nii.ac.jp/records/29527
http://ci.nii.ac.jp/naid/110000038939
http://ci.nii.ac.jp/naid/110000038939