Nonconvex Programming - Globe Thesis

Font Size: a A A

Keyword [Nonconvex Programming] Result: 1 - 14 \| Page: 1 of 1
1.	Study On Homotopy Method For A Local Minimum Of Nonconvex Programming Problem
2.	An Algorithm For Solving Conic Model Nonconvex Trust-region Subproblem
3.	The Regular Deformation Of Feasible Set Of Quadratic Constrained Optimization Problems
4.	Global Optimality Conditions And Optimization Methods For Several Classes Of Special Nonconvex Programming Problems
5.	Global Optimization Methods For Solving Several Classes Of Nonconvex Programming Problems
6.	Branch-and-Bound Algorithms Of Nonconvex Programming Problems
7.	Homotopy Algorithms For Solving Principal-Agent Bilevel Programming Problem And Fixed Point Problem
8.	A Homotopy-Penalty Method For Nonconvex Programming And Its Application In Sparse Portfolio
9.	Approximation Algorithms For Two Types Of Nonconvex Programming Problems
10.	Optimization Methods For Solving Two Types Of Nonconvex Programming Problems
11.	Global Optimality Conditions And Global Optimization Methods For Nonconvex Optimization Problem
12.	Research On Accelerated Algorithms For Several Optimization Problems
13.	Global Optimization Algorithms For Solving Two Classes Of Nonconvex Programming Problems
14.	Primal Dual Type Algorithms For Solving A Class Of Nonlinear Minimax Problems
<<First <Prev Next> Last>> Jump to