convex programming - Globe Thesis

Keyword [convex programming] Result: 21 - 40 \| Page: 2 of 4
21.	Generalized Semi-local Convex Functions And Generalized Semi-local Convex Programming
22.	Two Kinds Of Separable Lagrangian Function Methods For Minimizing The Sum Of Three Convex Functions
23.	Predictor-Corrector Algorithm For Large-scale Convex Programming Problems
24.	Merit Functions And Error Bounds For Constrained Mixed Set-valued Variational Inequalities Via Generalized F-Projection Operators In Hilbert Spaces
25.	The Study Of Gray Queuing System And E-convex Bilevel Programming Problem
26.	A Relaxed Alternating Directions Of Multipliers Method For Convex Programming
27.	Weak Pseudo-normal Cone Condition Of Non-convex Programming Homotopy Interior Point Method
28.	The Complexity Analysis For The Homotopy Method Of Non-convex Programming
29.	An Adaptive Branch Reduced And Bound Algorithm For Two Classes Of Nonlinear Programming
30.	Characterization Of Solution Sets Of E-convex Programming Problems
31.	The Global Optimization On The Sum Of Ratios And The Multiplicative
32.	Study On Some Splitting Methods For Convex Optimization And Monotone Variational Inequality And Their Algorithmic Complexity
33.	First Order Algorithms For Saddle Point Problems And Constrained Optimization
34.	The Study Of Alternative Direction Method Of Multipliers With Substitution And Error Bounds
35.	Optimality And Duality For Certain Generalized Convex Programming Problems
36.	Study Of Stochastic Convex Programming With Fuzzy Probability Distribution And Its Application
37.	Proximal Alternating Direction Methods For Convex Optimization
38.	Research On The Global Optimization Of Two Types Of Non-convex Programming Problems
39.	Numerical Calculation Of Multi-period Optimal Inventory Model With Conditional Value At Risk Constraints
40.	Splitting Algorithms And Parallel Projection Method And Its Application Limited Memory
<<First <Prev Next> Last>> Jump to