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

Inner Approximation Method for a Reverse Convex Programming Problem: An inner approximation method for a reverse convex programming problem

Autori: Tetsuzo Tanino Masahiro Inuiguchi Seiji Yamada

Zdroj: Journal of Optimization Theory and Applications. 107:355-389

Predmety: Numerical optimization and variational techniques, Convex programming, reverse convex programming, Nonlinear programming, global optimization, dual problem, inner approximation, 0101 mathematics, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1114-10.pdf
https://zbmath.org/1568148
https://zbmath.org/1566513
https://doi.org/10.1023/a:1026456730792
https://link.springer.com/content/pdf/10.1023/A:1026456730792.pdf
https://link.springer.com/article/10.1023%2FA%3A1026456730792

An inner approximation method for a reverse convex programming problem

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

Zdroj: IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028). 3:521-526

Prístupová URL adresa: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1114-10.pdf
https://link.springer.com/article/10.1023/A:1026456730792
https://ieeexplore.ieee.org/document/823264/

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

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

A Global Optimization Algorithm and its Applications for a Reverse Convex Programming Problem / 逆凸計画問題に対する大域的最適化アルゴリズムとその応用

Autori: Syuuji YAMADA 山田 修司

Zdroj: システム／制御／情報 / SYSTEMS, CONTROL AND INFORMATION. 2016, 60(2):47

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: YAMADA , Syuuji TANINO , Tetsuzo INUIGUCHI , Masahiro

Témy: Departmental Bulletin Paper.

URL: https://toyama-c.repo.nii.ac.jp/records/319
https://toyama-c.repo.nii.ac.jp/record/319/files/YAMADA%20Syuuji%20%20TANINO%20Tetsuzo%20INUIGUCHI%20Masahiro%E3%80%8036-19%E3%80%80pdf.pdf

Additional Titles: A Branch and Bound Procedure Using Penalty Functions to a Reverse Convex Programming Problem

Autori: YAMADA , Syuuji

Témy: Departmental Bulletin Paper.

URL: https://toyama-c.repo.nii.ac.jp/records/293
https://toyama-c.repo.nii.ac.jp/record/293/files/%E5%B1%B1%E7%94%B0%E3%80%80%E4%BF%AE%E5%8F%B8%E3%80%8037-10%E3%80%80.pdf

Additional Titles: A Branch and Bound Procedure Using Penalty Functions to a Reverse Convex Programming Problem

Témy: Departmental Bulletin Paper.

URL: http://hdl.handle.net/10191/26269
https://niigata-u.repo.nii.ac.jp/records/29526
http://ci.nii.ac.jp/naid/110000038955
https://niigata-u.repo.nii.ac.jp/record/29526/files/110000038955.pdf

A Branch and Bound Procedure Using Penalty Functions to a Reverse Convex Programming Problem

Autori: 166394

URL: https://niigata-u.repo.nii.ac.jp/record/29526/files/110000038955.pdf
http://hdl.handle.net/10191/26269
https://niigata-u.repo.nii.ac.jp/records/29526
http://ci.nii.ac.jp/naid/110000038955
http://ci.nii.ac.jp/naid/110000038955

逆凸計画問題に対するペナルティ関数を用いた分枝限定法

Additional Titles: A Branch and Bound Procedure Using Penalty Functions to a Reverse Convex Programming Problem

Autori: 山田, 修司 Yamada, Syuuji

Témy: 論文(Article), Departmental Bulletin Paper, text

URL: http://hdl.handle.net/10191/26269
http://ci.nii.ac.jp/naid/110000038955
http://ci.nii.ac.jp/naid/110000038955

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

Zdroj: An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem. 36:165-181

An Inner Approximation Method Using a Descent Method for a Reverse Convex Programming Problem (Nonlinear Analysis and Convex Analysis).

Autori: Tanino, Tetsuzo Inuiguchi, Masahiro Yamada, Syuuji

Témy: 410, Departmental Bulletin Paper., VoR.

URL: http://hdl.handle.net/2433/63773
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/63773/1/1136-17.pdf

An Inner Approximation Method Using a Descent Method for a Reverse Convex Programming Problem (Nonlinear Analysis and Convex Analysis)

Autori: Yamada, Syuuji Tanino, Tetsuzo Inuiguchi, Masahiro

Témy: departmental bulletin paper

URL: http://hdl.handle.net/2433/63773

An Inner Approximation Method for a Reverse Convex Programming Problem (Continuous and Discrete Mathematics for Optimization)

Autori: Yamada, Syuuji Tanino, Tetsuzo Inuiguchi, Masahiro

Témy: departmental bulletin paper

URL: http://hdl.handle.net/2433/63394

An Inner Approximation Method for a Reverse Convex Programming Problem (Continuous and Discrete Mathematics for Optimization).

Autori: Tanino, Tetsuzo Inuiguchi, Masahiro Yamada, Syuuji

Témy: 410, Departmental Bulletin Paper., VoR.

URL: http://hdl.handle.net/2433/63394
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/63394/1/1114-10.pdf

An Inner Approximation Method Using a Descent Method for a Reverse Convex Programming Problem (Nonlinear Analysis and Convex Analysis)

Zdroj: An Inner Approximation Method Using a Descent Method for a Reverse Convex Programming Problem (Nonlinear Analysis and Convex Analysis). 1136:147-161

An Inner Approximation Method for a Reverse Convex Programming Problem (Continuous and Discrete Mathematics for Optimization)

Zdroj: An Inner Approximation Method for a Reverse Convex Programming Problem (Continuous and Discrete Mathematics for Optimization). 1114:85-95

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

Zdroj: An Exact Penalty Parameter of an Inner Approximation Method for a Reverse Convex Programming Problem. 36:165-181

An inner approximation method using a descent method for a reverse convex programming problem

Autori: Yamada, Syuuji Tanino, Tetsuzo Inuiguchi, Masahiro

Predmety: Convex programming, Optimality conditions and duality in mathematical programming

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1647254