Non-smooth optimization - Globe Thesis

Font Size: a A A

Keyword [Non-smooth optimization] Result: 1 - 17 \| Page: 1 of 1
1.	The Theorey And Unified Algorithm For Minimization Of Locally Lipschitzian Functions
2.	Some New Results On The Projected Gradient Method
3.	Support Vector Machine Based On Artificial Error
4.	An Approximate Inexact Accelerated Proximal Gradient Method For The Minimization Problem Of A Class Of Maximum Eigenvalue Functions
5.	The UV-theory For A Class Of The Maximum Eigenvalue Functions Optimizations
6.	The Improved Research On Trust Region Algorithms Of Non-smooth Optimization
7.	Characterizations And Applications Of The Weak Sharp Minima For Non-smooth Optimization Problems
8.	The Study Of Optimality Conditions And Algorithms For Non-smooth Optimization In Hilbert Space
9.	A Redistributed Bundle Method For A Class Of Nonsmooth Unconstrained DC Optimization Problems
10.	Derivative-free Method For Non-convex And Non-smooth Multiobjective Programming Under Convex Constraints
11.	A Feasible Bundle Method For Solving Inequality Constrained Minmax Problems
12.	Solution Methods For Minimizing A Class Of Clipped Functions
13.	Improvement Of Set Segmentation Method And Its Application In Nonconvex Optimization Problems
14.	A Bundle Method With Inexact Data For CvaR Portfolio Optimization Problem
15.	An Improved Hybrid Bundle Method For Solving A Class Of Portfolio Optimization Problems
16.	An Inexact Bundle Method For Solving The Routing Selection Problem In Telecommunication Networks
17.	Research On Hybrid Bundle Method For Routing Selection Problem In Telecommunication Networks
<<First <Prev Next> Last>> Jump to