DETERMINATION OF VISUAL DOUBLE STAR ORBIT TRAJECTORY USING SEMIDEFINITE PROGRAMMING
Semidefinite programming is an optimization field to minimize or maximize linear objective function problem with positive semidefinite matrix constraints. Semide-finite programming is an extension of linear programming so that the interior point method that applies to linear programming can be used...
Saved in:
Main Author: | YASINTA (NIM: 10114077), NADA |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/29465 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
EFFICIENT ALGORITHMS FOR LEAST SQUARES SEMIDEFINITE PROGRAMMING AND SEMIDEFINITE PROGRAMMING WITH A LARGE NUMBER OF CONSTRAINTS
by: YANG LIUQIN
Published: (2015) -
Reduction of symmetric semidefinite programs using the regular representation
by: Klerk, Etienne de., et al.
Published: (2012) -
PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING
by: SANDRA TAN SHI YUN
Published: (2020) -
Studies in Communication Complexity and Semidefinite Programs
by: PENGHUI YAO
Published: (2014) -
On the Nesterov-Todd direction in semidefinite programming
by: Todd, M.J., et al.
Published: (2014)