Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression (Q7404339)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

scientific article; zbMATH DE number 8272586

Language	Label	Description	Also known as
default for all languages	No label defined
English	Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression	scientific article; zbMATH DE number 8272586

Statements

instance of

scholarly article

0 references

title

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression (English)

0 references

0 references

0 references

0 references

Optimization and Engineering

0 references

publication date

2026

0 references

zbMATH Keywords

nonsmooth optimization

0 references

optimal control

0 references

randomized sketching

0 references

dynamic optimization

0 references

compression

0 references

PDE-constrained optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Frontiers in PDE-constrained optimization. Selected papers based on the presentations at the workshop, Minneapolis, MN, USA, June 6--10, 2016

0 references

Approximation of Large-Scale Dynamical Systems

0 references

Optical tomography: forward and inverse problems

0 references

Optimal multistage algorithm for adjoint computation

0 references

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

0 references

Local convergence analysis of an inexact trust-region method for nonsmooth optimization

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Probing the Pareto frontier for basis pursuit solutions

0 references

On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information

0 references

Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information

0 references

Proximal splitting methods in signal processing

0 references

Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds

0 references

Trust Region Methods

0 references

Towards efficient backward-in-time adjoint computations using data compression techniques

0 references

Reduced basis method and a posteriori error estimation for parametrized linear-quadratic optimal control problems

0 references

Optimal power generation under uncertainty via stochastic programming

0 references

Reduced order modelling approaches to PDE-constrained optimization based on proper orthogonal decomposition

0 references

Optimal Boundary Control for the Evolutionary Navier--Stokes System: The Three-Dimensional Case

0 references

Lossy compression in optimal control of cardiac defibrillation

0 references

Reducing memory requirements in scientific computing and optimal control

0 references

Lossy compression for PDE-constrained optimization: adaptive error control

0 references

Algorithm 799: revolve

0 references

Perspectives in Flow Control and Optimization

0 references

Active control and drag optimization for flow past a circular cylinder. I: Oscillatory cylinder rotation

0 references

Reduced order model Hessian approximations in Newton methods for optimal control

0 references

Analysis of inexact trust-region SQP algorithms

0 references

Annular and sectorial sparsity in optimal control of elliptic equations

0 references

Directional sparsity in optimal control of partial differential equations

0 references

Optimization with PDE Constraints

0 references

Reduced order systems.

0 references

A trust-region algorithm with adaptive stochastic collocation for PDE optimization under uncertainty

0 references

Inexact objective function evaluations in a trust-region algorithm for PDE-constrained optimization under uncertainty

0 references

Inexact trust-region methods for PDE-constrained optimization

0 references

Newton's Method for Large Bound-Constrained Optimization Problems

0 references

Detailed simulation of viral propagation in the built environment

0 references

Randomized sketching algorithms for low-memory dynamic optimization

0 references

Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints

0 references

Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices

0 references

The Conjugate Gradient Method and Trust Regions in Large Scale Optimization

0 references

New algorithms for optimal online checkpointing

0 references

Q4864293

0 references

Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space

0 references

Streaming low-rank matrix approximation with an application to scientific simulation

0 references

Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation

0 references

An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids

0 references

Q4767830

0 references

Identifiers

DOI

10.1007/S11081-025-10061-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression