Results 81 to 90 of about 173 (143)
New Hybrid Conjugate Gradient Method as a Convex Combination of PRP and RMIL+ Methods
The Conjugate Gradient (CG) method is a powerful iterative approach for solving large-scale minimization problems, characterized by its simplicity, low computation cost and good convergence. In this paper, a new hybrid conjugate gradient HLB method (HLB:
BENZINE, Rachid +3 more
core +1 more source
NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION. [PDF]
SIAM J Optim, 2020 Chen Y, Chi Y, Fan J, Ma C, Yan Y.
europepmc +1 more source
The directional subdifferential of the difference of two convex functions
We provide a criterion giving a formula for the directional (or contingent) subdifferential of the difference of two convex functions. We even extend it to the difference of two approximately starshaped functions.
Jean-Paul Penot
core +1 more source
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm. [PDF]
Vietnam J Math, 2020 Artacho FJA, Campoy R, Vuong PT.
europepmc +1 more source
Conic separation of finite sets. I. The homogeneous case
, 2020 . This work addresses the issue of separating two finite sets in R n by means of a suitable revolution cone The specific challenge at hand is to determine the aperture coefficient s, the axis y, and the apex z of the cone.
Manlio Gaudioso +2 more
core
First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints [PDF]
, 2008 2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52.The constrained optimization problem min f(x), gj(x) ≤ 0 (j = 1,…p) is considered, where f : X → R and gj : X → R are nonsmooth functions with domain X ⊂ Rn.
Ivanov, Vsevolod I., Ginchev, Ivan
core
Data for TROTS - The Radiotherapy Optimisation Test Set. [PDF]
Data Brief, 2017 Breedveld S, Heijmen B.
europepmc +1 more source
A tensor trust-region model for nonlinear system. [PDF]
J Inequal Appl, 2018 Wang S, Liu S.
europepmc +1 more source
Determinantmaxrmin Tion Of A Nonsymmetric Matrix With Quadratic Constraints
, 2002 This paper presents the problem of maximizing the determinant of a K-square real matrix B, subject to the constraint that each row b k of B satisfies b 1, where # 1 ,...,# K , are K given real symmetric positive definite matrices.
Abdelhamid Zaïdi +2 more
core