Semidefinite programming - Globe Thesis

Keyword [Semidefinite programming] Result: 61 - 80 \| Page: 4 of 7
61.	The Study On Several Algorithms For Semidefinite Programming
62.	Additive Constant Methods For Multidimensional Scaling
63.	Two Numerical Methods. Solutions Semidefinite Programming
64.	Study On Complexity Of Some Interior-Point Algorithms In Conic Programming
65.	The CVaR-SP Reformulation And The DRO Reformulation For Stochastic Complementarity Problems
66.	Homotopy Method For Bilinear Semidefinite Programming
67.	Applications Of Polynomial Optimization Methods In Quadratic Programming Problems
68.	Research On Some Problems Of Quadratic Semidefinite Programmings
69.	Distributionally Robust Joint Chance Constraints Optimization
70.	Estimating Bounds On Linear Functional Deifned On Solution Of Linear Differential And Integral Equations
71.	A Study On Nonmonotonic Trust Region Algorithm For Semidefinite Programming
72.	The Application Of Semidefinite Programming In The Study Of Multiparticle Genuine Entanglement
73.	Interior-point Algorithms Based On Wide Neighborhood For Conic Programming
74.	Infeasible Interior Point Algorithm For Semidefinite Programming
75.	Solving Complex Semidefinite Programming With Inequality Constraints And Application
76.	Two Primal Dual Interior Point Algorithms For Convex Quadratic Semidefinite Programming
77.	Solution Of A Class Of Nonlinear Distributionally Robust Chance Constrain Problems
78.	A Class Of Distributionnally Robust Optimization Problem Based On CVaR Model
79.	Two Classes Of Primal-dual Interior-point Algorithms For Semidefinite Programming
80.	Research On Infeasible Interior Point Method For Semidefinite Programming
<<First <Prev Next> Last>> Jump to