Font Size: a A A
Keyword [convex optimization]
Result: 41 - 60 | Page: 3 of 10
41. Proximal Alternating Direction Methods For Convex Optimization
42. The Research Of Alternating Direction Methods And Their Modification
43. Spectral Gradient Algorithm For Matrix L2,1-Norm Minimization
44. Nested Minimizing Algorithms For Subspace Recovery Problem
45. Parallel Proximal Method For A Class Of Nonsmooth Convex Optimization Problems
46. Distributed Optimization Algorithms For Multi-Agent Systems With Communication Delays
47. Newton Type Algorithms For Singular Convex Optimization Problems And Constrained Monotone Nonlinear Equations
48. Alternating Linearization Algorithms For Several Kinds Of Nonsmooth Optimizations
49. Linearized Alternating Direction Method For Solving Separable Convex Optimization Problems
50. Several Studies Of Binary Model
51. Theory And Algorithms Of Sparse Recovery Via Non-convex Optimization
52. Iterative Algorithms And Its Applications For The Zero Points Problems Of The Monotone Operators In Hilbert Spaces
53. Iterative Algorithms For Constrained Convex Optimization Problems In Hilbert Spaces
54. A Memoryless Gradient Method For Nosmooth Convex Optimization
55. Convergence Of The Inexact Semi-Proximal Alternating Direction Methods Of Multipliers
56. Proximal Algorithms Analysis And Applications For Unconstrained Convex Optimization Problems
57. Several Algorithms Of Bi-level Multi-objective Problem
58. An Approximate Bundle Method For Non-Convex Optimization And Convergence Theory
59. Alternating Direction Method Of Multipliers With Applications In Inverse Covariance Matrix Estimation
60. On The Proximal Gradient Method For Minimizing The Sum Of Two Functions
  <<First  <Prev  Next>  Last>>  Jump to