Inversion of convection-diffusion equation with discrete sources
From MaRDI portal
Publication:2129202
DOI10.1007/s11081-020-09536-5zbMath1484.90051OpenAlexW3043873204MaRDI QIDQ2129202
Meenarli Sharma, Lars Ruthotto, Mirko Hahn, Sven Leyffer, Bart G. van Bloemen Waanders
Publication date: 22 April 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-020-09536-5
mixed-integer optimizationPDE-constrained optimizationmixed-integer nonlinear programmingsource inversion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Nonlinear total variation based noise removal algorithms
- Relaxation methods for mixed-integer optimal control of partial differential equations
- The integer approximation error in mixed-integer optimal control
- Combinatorial integral approximation
- On optimization algorithms for the reservoir oil well placement problem
- SCIP: solving constraint integer programs
- High-order discretization and multigrid solution of elliptic nonlinear constrained optimal control problems
- On PDE solution in transient optimization of gas networks
- Variational methods in imaging
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Local branching
- MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- An exact penalty global optimization approach for mixed-integer programming problems
- Deterministic global optimization. Theory, methods and applications
- A branch-and-cut method for 0-1 mixed convex programming
- A GCV based method for nonlinear ill-posed problems
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Domain decomposition methods for advection-dominated linear-quadratic elliptic optimal control problems
- Discrete total variation with finite elements and applications to imaging
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Generalized Benders decomposition
- The feasibility pump
- Cuts for mixed 0-1 conic programming
- Mixed integer models for the stationary case of gas network optimization
- Grid refinement and scaling for distributed parameter estimation problems
- Preconditioned all-at-once methods for large, sparse parameter estimation problems
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- The Lagrangian relaxation for the combinatorial integral approximation problem
- Julia: A Fresh Approach to Numerical Computing
- The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- MultiDimensional Sum-Up Rounding for Elliptic Control Systems
- Simultaneous Pseudo-Timestepping for Aerodynamic Shape Optimization Problems with State Constraints
- Integration of Sequential Quadratic Programming and Domain Decomposition Methods for Nonlinear Optimal Control Problems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Optimization with PDE Constraints
- Multigrid Methods for PDE Optimization
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A New Algorithm for the 0-1 Knapsack Problem
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Facets of the knapsack polytope
- Computing Partitions with Applications to the Knapsack Problem
- Numerical Optimization
- Rank-Deficient and Discrete Ill-Posed Problems
- Trust Region Methods
- Relaxation methods for hyperbolic PDE mixed‐integer optimal control problems
- Large-Scale PDE-Constrained Optimization: An Introduction
- Sparse Matrix Computations Arising in Distributed Parameter Identification
- Computational Methods for Inverse Problems
- Perspectives in Flow Control and Optimization
- Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming
- Improved regularity assumptions for partial outer convexification of mixed-integer PDE-constrained optimization problems
- Real-Time PDE-Constrained Optimization
- Space Mapping for Optimal Control of Partial Differential Equations
- jInv--a Flexible Julia Package for PDE Parameter Estimation
- Mixed-integer nonlinear optimization
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur Solver
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part II: The Lagrange--Newton Solver and Its Application to Optimal Control of Steady Viscous Flows
- Chapter 9: Mixed-Integer DAE Optimal Control Problems: Necessary Conditions and Bounds
- A tree-search algorithm for mixed integer programming problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Image Processing and Analysis
- JuMP: A Modeling Language for Mathematical Optimization
