Results 181 to 190 of about 24,030 (229)

Optimization and Nonsmooth Analysis [PDF]

, 1990
openaire   +1 more source

Computationally efficient whole-genome quantile regression at biobank scale. [PDF]

Proc Natl Acad Sci U S A
Wang F, Wang C, Wang T, Masala M, Fiorillo E, Devoto M, Cucca F, Ionita-Laza I.   +7 more
europepmc   +1 more source

RegularizedOptimization.jl: A julia framework for regularized and nonsmooth optimization

Maxence Gollier, Dominique, Mohamed Béchir Ould Mohamed Laghdaf, geoffroyleconte, De Marchi Alberto, Dominique, geoffroyleconte   +6 more
openalex  

MRI-based intra-tumoral ecological diversity features and temporal characteristics for predicting microvascular invasion in hepatocellular carcinoma. [PDF]

Front Oncol
Zeng Y, Wu H, Zhu Y, Li C, Du D, Song Y, Su S, Qin J, Jiang G.   +8 more
europepmc   +1 more source

Gas Turbine Blade Failures Repaired Using Laser Metal Additive Remanufacturing. [PDF]

Materials (Basel)
Chen C, Zhang M, Liu H, Yang Q.
europepmc   +1 more source

Equivalent-Uniform-Dose Optimization for Spatially Fractionated Radiation Therapy. [PDF]

Technol Cancer Res Treat
Zhu YN, Zhang W, Lin Y, Gao H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Nonsmooth Optimization Methods

2020
This chapter is devoted to the description of some general methods of nonsmooth optimization. The first two—the standard subgradient and the proximal bundle methods—form the basis for numerical nonsmooth optimization. In addition, we will focus on the methods that will be utilized in the clustering algorithms given in Part II of this book. They are the
Adil M. Bagirov, Napsu Karmitsa, Sona Taheri   +2 more
openaire   +1 more source

Nonsmooth Optimization Algorithms

1996
Quasidifferentiable and codifferentiable optimization algorithms are based on gradientlike, descent, iterative techniques whereas gradient information is replaced by the setvalued quasidifferential or the codifferential. Then the steepest descent finding subproblems are appropriately replaced by quadratic programming subproblems with a polyhedral ...
Vladimir F. Dem’yanov, Georgios E. Stavroulakis, Ludmila N. Polyakova, Panagiotis D. Panagiotopoulos   +3 more
openaire   +1 more source