Results 11 to 20 of about 36,010,976 (311)

On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems [PDF]

open access: yesEntropy, 2021
This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the ...
Agnieszka Prusińska   +2 more
doaj   +2 more sources

Incorporating the Soil Gas Gradient Method and Functional Genes to Assess the Natural Source Zone Depletion at a Petroleum-Hydrocarbon-Contaminated Site of a Purification Plant in Northwest China [PDF]

open access: yesLife, 2022
An increasing number of studies have demonstrated that natural source zone depletion (NSZD) in the vadose zone accounts for the majority (90%~99%) of the natural attenuation of light non-aqueous phase liquid (LNAPL).
Zhuo Ning   +5 more
doaj   +2 more sources

Toward Communication Efficient Adaptive Gradient Method [PDF]

open access: yesFoundations of Data Science Conference, 2020
In recent years, distributed optimization is proven to be an effective approach to accelerate training of large scale machine learning models such as deep neural networks. With the increasing computation power of GPUs, the bottleneck of training speed in
Xiangyi Chen, Xiaoyun Li, P. Li
semanticscholar   +1 more source

Gradient Convergence in Gradient methods with Errors [PDF]

open access: yesSIAM Journal on Optimization, 2000
Summary: We consider the gradient method \(x_{t+1}=x_t+\gamma_t(s_t+w_t)\), where \(s_t\) is a descent direction of a function \(f:{\mathfrak R}^n\to{\mathfrak R}\) and \(w_t\) is a deterministic or stochastic error. We assume that \(\nabla f\) is Lipschitz continuous, that the stepsize \(\gamma_t\) diminishes to 0, and that \(s_t\) and \(w_t\) satisfy
Dimitri P. Bertsekas, John N. Tsitsiklis
openaire   +1 more source

A Potential Framework for Allocating National Park Service Budgets

open access: yesFrontiers in Forests and Global Change, 2022
The US Department of Interior, including the National Park Service (NPS), has interest in developing a national fire budgeting process that reflects and promotes program (fuels and preparedness) efficiencies while being transparent, fair, stable, and ...
Douglas B. Rideout   +3 more
doaj   +1 more source

On penalty-based bilevel gradient descent method [PDF]

open access: yesMathematical programming, 2023
Bilevel optimization enjoys a wide range of applications in emerging machine learning and signal processing problems such as hyper-parameter optimization, image reconstruction, meta-learning, adversarial training, and reinforcement learning.
Han Shen, Tianyi Chen
semanticscholar   +1 more source

Optimization of a fractional Mayer problem - existence of solutions, maximum principle, gradient methods [PDF]

open access: yesOpuscula Mathematica, 2014
In the paper, we study a linear-quadratic optimal control problem of Mayer type given by a fractional control system. First, we prove a theorem on the existence of a solution to such a problem. Next, using the local implicit function theorem, we derive a
Dariusz Idczak, Stanislaw Walczak
doaj   +1 more source

Robust Algorithm Software for NACA 4-Digit Airfoil Shape Optimization Using the Adjoint Method

open access: yesApplied Sciences, 2023
Optimizing the aerodynamic shape of an airfoil is a critical concern in the aviation industry. The introduction of flexible airfoils has allowed the shape of the airfoil to vary, depending on the flight conditions. Therefore, in this study, we propose an
Naser Tanabi   +3 more
doaj   +1 more source

Proximal Gradient Method for Solving Bilevel Optimization Problems

open access: yesMathematical and Computational Applications, 2020
In this paper, we consider a bilevel optimization problem as a task of finding the optimum of the upper-level problem subject to the solution set of the split feasibility problem of fixed point problems and optimization problems.
Seifu Endris Yimer   +2 more
doaj   +1 more source

A New Adaptive Gradient Method with Gradient Decomposition

open access: yesCoRR, 2021
Adaptive gradient methods, especially Adam-type methods (such as Adam, AMSGrad, and AdaBound), have been proposed to speed up the training process with an element-wise scaling term on learning rates. However, they often generalize poorly compared with stochastic gradient descent (SGD) and its accelerated schemes such as SGD with momentum (SGDM).
Zhou Shao, Tong Lin
openaire   +2 more sources

Home - About - Disclaimer - Privacy