Computational Aspects of Bilinear Matrix Inequality Problems

スポンサーリンク

概要

• 論文の詳細を見る
• 社団法人日本オペレーションズ・リサーチ学会の論文
• 1998-10-15

著者

• Kojima Masakazu

  Tokyo Institute of Technology

• Fukuda Mituhiro

  Tokyo Institute of Technology

関連論文

• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(Network Design, Control and Optimization)
• ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(the 50th Anniversary of the Operations Research Society of Japan)
• EFFICIENT EVALUATION OF POLYNOMIALS AND THEIR PARTIAL DERIVATIVES IN HOMOTOPY CONTINUATION METHODS
• Computational Aspects of Bilinear Matrix Inequality Problems
• SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
• A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES

スポンサーリンク