Results 71 to 80 of about 2,699 (199)

Accelerated Interior Point Algorithms for Rate‐Independent Single Crystal Plasticity at Small Strains

open access: yesProceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.
ABSTRACT Rate‐independent single crystal plasticity requires robust solution methods due to the non‐uniqueness of slip system activity. The interior point method, which enforces the yield criterion via slack variables and a so‐called barrier term, has proven both robust and computationally efficient for this class of problems and has been applied to ...
Felix Steinmetz, Lisa Scheunemann
wiley   +1 more source

Augmented Lagrangian method for coupled-cluster

open access: yesCoRR
We propose to improve the convergence properties of the single-reference coupled cluster (CC) method through an augmented Lagrangian formalism. The conventional CC method changes a linear high-dimensional eigenvalue problem with exponential size into a problem of determining the roots of a nonlinear system of equations that has a manageable size ...
Fabian M. Faulstich   +2 more
openaire   +2 more sources

An augmented Lagrangian approach to Wasserstein gradient flows and applications

open access: yesESAIM: Proceedings and Surveys, 2016
Taking advantage of the Benamou-Brenier dynamic formulation of optimal transport, we propose a convex formulation for each step of the JKO scheme for Wasserstein gradient flows which can be attacked by an augmented Lagrangian method which we call the ...
Benamou Jean-David   +2 more
doaj   +1 more source

A Semi‐Discrete Lagrangian‐Eulerian Numerical Scheme for Diffusive‐Dispersive Conservation Laws With Discontinuous Coefficient

open access: yesNumerical Methods for Partial Differential Equations, Volume 42, Issue 5, September 2026.
ABSTRACT In this work, we present an extension of the semi‐discrete Lagrangian‐Eulerian numerical scheme for diffusive‐dispersive conservation law problems, including a jump discontinuous flux function. As in the one‐dimensional scalar hyperbolic case, the no‐flow curves also organize the geometry of the method.
Eduardo Abreu   +2 more
wiley   +1 more source

Model Predictive Control of Gas Networks Based on Port‐Hamiltonian Formulations

open access: yesProceedings in Applied Mathematics and Mechanics, Volume 26, Issue 3, September 2026.
ABSTRACT To efficiently compute optimal compressor actions in gas networks, we investigate port‐Hamiltonian models consisting of linear and a nonlinear model assumptions. The control actions are derived via adjoint‐based gradients that incorporate the constraints of the underlying optimization problem. We then present results from the implementation of
Andres Ortegón‐Villacorte   +1 more
wiley   +1 more source

Solution of the Simultaneous Routing and Bandwidth Allocation Problem in Energy-Aware Networks Using Augmented Lagrangian-Based Algorithms and Decomposition

open access: yesEnergies
We discuss several algorithms for solving a network optimization problem of simultaneous routing and bandwidth allocation in green networks in a decomposed way, based on the augmented Lagrangian. The problem is difficult due to the nonconvexity caused by
Anthony Chukwuemeka Nwachukwu   +1 more
doaj   +1 more source

A new augmented Lagrangian primal dual algorithm for elastica regularization

open access: yesJournal of Algorithms & Computational Technology, 2016
Regularization is a key element of variational models in image processing. To overcome the weakness of models based on total variation, various high order (typically second order) regularization models have been proposed and studied recently. Among these,
Jianping Zhang, Ke Chen
doaj   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source

Home - About - Disclaimer - Privacy