nonlinear semidefinite programming - Globe Thesis

Keyword [nonlinear semidefinite programming] Result: 1 - 17 \| Page: 1 of 1
1.	Homotopy Methods For Nonlinear Programming, Nonlinear Second-Order Cone Programming And Nonlinear Semidefinite Programming
2.	Study Of Several Algorithms For Semidefinite Programming Problems
3.	Differential-Algebraic Algorithm And Sequential Penalty Algorithm For Semidefinite Programming
4.	NLSDP Algorithms For Confidence Structural Robust Design And Optimization
5.	Two Sequential Semidefinite Programming Algorithms Without A Penalty Function Or A Filter For Nonlinear Semidefinite Programming
6.	Two Globally Convergent QP-Free Algorithms For Nonlinear Semidefinite Programming
7.	Nonsingularity Study Of The Parametric FB System For Nonlinear Semidefinite Programming
8.	A Globally Convergent Interior-Point Algorithm For Inequality-Constrained Nonlinear Semidefinite Programming
9.	A Primal-Dual Interior-Point Method Of Using The Augmented Lagrangian Function For Nonlinear Semidefinite Programming
10.	A Primal-Dual Interior-Point Algorithm Based On Decomposition For Nonlinear Semidefinite Programming
11.	The CVaR-SP Reformulation And The DRO Reformulation For Stochastic Complementarity Problems
12.	The Method Of Overcoming The Maratos Effect In Nonlinear Semidefinite Programming
13.	Two SSDP Algorithms For Nonlinear Semidefinite Programming
14.	A Primal-dual Interior-point Method For Nonlinear Semidefinite Programming
15.	Two Filter Algorithms For Nonlinear Semidefinite Programming
16.	Partially Augmented Lagrangian Method For Matrix Inequality Constraints
17.	A Superlinearly Convergent Feasible SSDP Algorithm For Nonlinear Semidefinite Programming
<<First <Prev Next> Last>> Jump to