JSTOR Daily

Numerical experiments on stochastic block proximal-gradient type method for convex constrained optimization involving coordinatewise separable problems

Vol. 35, No. 3, Special issue dedicated to professor Qamrul Hasan Ansari on the occasion of his 6oth anniversary (2019), pp. 371-378 (8 pages) In this paper, we consider convex constrained ...
IEEE

Genetic Algorithm-Accelerated Optimization for Runge-Kutta Scheme Derivation in High-Dimensional Problems With Hard Constraints

Abstract: The numerical derivation of high-order Extended Stability Runge-Kutta (ERSK) integration schemes presents significant challenges due to the high-dimensional, non-convex, non-linear ...
IEEE

Fixed-Time Dynamical System Approach for Solving Time-Varying Convex Optimization Problems

Abstract: A time-varying (TV) optimization problem arises in many real-time applications, where the objective function or constraints change continuously with time. Consequently, the optimal points of ...
JSTOR Daily

Successive approximations for the solution of second order advanced differential equations

For the initial value problem associated with second order advanced differential equation on Banach space, it is constructed a numerical method to approximate the solution. The method uses the ...
Oak Ridge National Lab

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

n this talk, I present a predictor-corrector strategy for constructing rank-adaptive dynamical low-rank approximations (DLRAs) of matrix-valued ordinary differential equation systems. The strategy is ...
Oak Ridge National Lab

An Augmented Lagrangian Method For Nonconvex Optimization Problems with Conically-Convex Constraints

This talk presents and analyzes a novel nonlinear inner accelerated inexact proximal augmented Lagrangian (NL-IAIPAL) method for solving smooth nonconvex composite optimization problems with nonlinear ...