convex programming - Globe Thesis

Keyword [convex programming] Result: 41 - 60 \| Page: 3 of 4
41.	Algorithms For Low-rank Matrix And Tensor Completion Problems
42.	Comparison Of Fast Algorithm For Ellipsoid Projection
43.	Multi - Criteria And Multi - Constrained Horizontal Nonlinear Programming Theory And Its Application
44.	Linearized Alternating Direction Method For Solving Separable Convex Optimization Problems
45.	Researches On Splitting Methods For Optimization Problems And The Morning Peak-period Congestion Problems
46.	Study On A Class Of Parallel Primal-dual Methods And Their Applications On Saddle-point Problems
47.	The Research Of The Generalized E-convexity And Related Optimization Questions
48.	On The Convergence Analysis Of Proximal-based Symmetric Alternating Directions Methods Of Multipliers With Large Step Size
49.	Two Splitting Methods For Two-block Convex Programming
50.	Quantitative Stability Analysis Of Quasi-variational Inequality Problems
51.	Research On Non-convex Optimization Algorithms For UAV Path Planning Problems
52.	Optimization Algorithms Based On Alternating Direction Multiplier Method And Operator Splitting
53.	Study On The Splitting Algorithms For Separable Convex Pro- Gramming And Their Applications
54.	First-order Algorithms For Some Special Generalized Variational Inequality Problems And Their Applications
55.	Convergence Analysis Of Two Types Of ADMM With Positive-indefinite Proximal Regularization
56.	Iterative Algorithm For Generalized Fractional Programming Problems
57.	An Inertial Proximal Peaceman-rachford Splitting Method For Solving Structured Convex Optimization
58.	An Efficient Proximal Dc Approach For Fitting The Sparse Envelope Model
59.	Research On Nonconvex Classification-based Algorithm For Peptide Identification
60.	A Relaxed Inertial Proximal Peaceman-Rachford Splitting Method For Separable Convex Programming
<<First <Prev Next> Last>> Jump to