A Fixed Point Theorem for Discontinuous Functions
AMS classifications: 54H25, 65K10, 49J53, 68W25Fixed point;simplicial subdivision;discontinuity ...
Herings, P.J.J. +3 more
core
Truncated Newton Methods For Optimization With Inaccurate Functions And Gradients
, 1999 . We consider unconstrained minimization problems that have functions and gradients given by "black box" codes with error control. We discuss several modifications of the Steihaug truncated Newton method that can improve performance for such ...
E.W. Sachs, C. T. Kelley, E. W. Sachs
core
New Chemicals Suppressing SARS-CoV-2 Replication in Cell Culture. [PDF]
Molecules, 2022 Sulimov A +8 more
europepmc +1 more source
Constrained and unconstrained deep image prior optimization models with automatic regularization. [PDF]
Comput Optim Appl, 2023 Cascarano P +4 more
europepmc +1 more source
Unified Robust Necessary Optimality Conditions for Nonconvex Nonsmooth Uncertain Multiobjective Optimization. [PDF]
J Optim Theory Appl, 2022 Wang J, Li S, Feng M.
europepmc +1 more source
Preconditioners For The Reduced Hessian In Elliptic Variational Inequalities
, 2007 . We show how a class of preconditioners for reduced Hessians in constrained optimization can be applied to certain elliptic variational inequalities.
Choi Kelley, T. D. Choi, C. T. Kelley
core
A refined Newton’s mesh independence principle for a class of optimal shape design problems
Open Mathematics, 2006 Argyros Ioannis
doaj +1 more source
A Least-Squares Method for the Solution of the Non-smooth Prescribed Jacobian Equation. [PDF]
J Sci Comput, 2022 Caboussat A +2 more
europepmc +1 more source
A Unified Approach to Shape and Topological Sensitivity Analysis of Discretized Optimal Design Problems. [PDF]
Appl Math Optim, 2023 Gangl P, Gfrerer MH.
europepmc +1 more source
The efficient computation of sparse Jacobian matrices using automatic differentiation
, 1995 This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, to exploit the sparsity of the ...
Thomas Coleman +3 more
core