New Results on Superlinear Convergence of Classical Quasi-Newton Methods. [PDF]
J Optim Theory Appl, 2021 Rodomanov A, Nesterov Y.
europepmc +1 more source
We propose a convex quadratic programming (CQP) relaxation for multi-ball constrained quadratic optimization (MB). (CQP) is shown to be equivalent to semidefinite programming relaxation in the hard case.
Zhuoyi Xu, Yong Xia, Jiulin Wang
core +1 more source
A non-monotone pattern search approach for systems of nonlinear equations. [PDF]
Int J Comput Math, 2019 Amini K, Kimiaei M, Khotanlou H.
europepmc +1 more source
Improved risk prediction via cross-domain calibration in a retrospective case-control study. [PDF]
Can J StatZhao G, Ma Y, Cao Y.
europepmc +1 more source
APPROACHES TO ITERATIVE ALGORITHMS FOR SOLVING NONLINEAR EQUATIONS WITH AN APPLICATION IN TOMOGRAPHIC ABSORPTION SPECTROSCOPY. [PDF]
Commun Optim TheoryAragón-Artacho FJ +5 more
europepmc +1 more source
A new smoothing modified three-term conjugate gradient method for [Formula: see text]-norm minimization problem. [PDF]
J Inequal Appl, 2018 Du S, Chen M.
europepmc +1 more source
A quadratically constrained mixed-integer non-linear programming model for multiple sink distributions. [PDF]
HeliyonAdjei BA +3 more
europepmc +1 more source
Data for TROTS - The Radiotherapy Optimisation Test Set. [PDF]
Data Brief, 2017 Breedveld S, Heijmen B.
europepmc +1 more source
Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices. [PDF]
Math ProgramRebjock Q, Boumal N.
europepmc +1 more source
On uniqueness of Lagrange multipliers in optimization problems subject to cone constraints
, 1997 . In this paper we study uniqueness of Lagrange multipliers in optimization problems subject to cone constraints. The main tool in our investigation of this question will be a calculus of dual (polar) cones. We give sufficient and in some cases necessary
Pii S, Alexander Shapiro
core