Derivative-free optimization methods (Q5230522): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 22:34, 13 November 2024

scientific article; zbMATH DE number 7099161

Language	Label	Description	Also known as
English	Derivative-free optimization methods	scientific article; zbMATH DE number 7099161

Statements

scholarly article

0 references

Derivative-free optimization methods (English)

0 references

0 references

Matt Menickelly

0 references

0 references

0 references

publication date

28 August 2019

0 references

full work available at URL

https://arxiv.org/abs/1904.11585

0 references

zbMATH Keywords

derivative free optimization

0 references

unconstrained

0 references

constrained

0 references

stochastic

0 references

DDS

0 references

GPS

0 references

MADS

0 references

Trust Region

0 references

SQP

0 references

WCC

0 references

complexity

0 references

convergence

0 references

algorithm

0 references

simulation

0 references

composite non smooth

0 references

bilevel

0 references

minimax

0 references

penalty

0 references

augmented Lagrangian

0 references

local and global optimization

0 references

multi-objective

0 references

multistart

0 references

under estimator

0 references

multi fidelity

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Second-Order Behavior of Pattern Search

0 references

Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points

0 references

Generalized pattern searches with derivative information

0 references

Mesh adaptive direct search algorithms for mixed variable optimization

0 references

OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions

0 references

A subclass of generating set search with convergence to second-order stationary points

0 references

0 references

Stochastic Convex Optimization with Bandit Feedback

0 references

Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

0 references

Sample mean based index policies by <i>O</i>(log <i>n</i>) regret for the multi-armed bandit problem

0 references

Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm

0 references

Simulation optimization: a review of algorithms and applications

0 references

Active-set strategy in Powell's method for optimization without derivatives

0 references

Convergence results for generalized pattern search algorithms are tight

0 references

A Survey on Direct Search Methods for Blackbox Optimization and Their Applications

0 references

Pattern Search Algorithms for Mixed Variable Programming

0 references

Analysis of Generalized Pattern Searches

0 references

A Pattern Search Filter Method for Nonlinear Programming without Derivatives

0 references

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

0 references

A Progressive Barrier for Derivative-Free Nonlinear Programming

0 references

Derivative-Free and Blackbox Optimization

0 references

Performance indicators in multiobjective optimization

0 references

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

0 references

Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms

0 references

Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm

0 references

Linear equalities in blackbox optimization

0 references

Multiobjective Optimization Through a Series of Single-Objective Formulations

0 references

A mesh adaptive direct search algorithm for multiobjective optimization

0 references

10.1162/153244303321897663

0 references

Finite-time analysis of the multiarmed bandit problem

0 references

The Nonstochastic Multiarmed Bandit Problem

0 references

Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization

0 references

Discrete gradient method: Derivative-free method for nonsmooth optimization

0 references

Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points

0 references

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization

0 references

Convergence of Trust-Region Methods Based on Probabilistic Models

0 references

The solution of variational and boundary value problems by the method of local variations

0 references

Nelder-Mead Simplex Modifications for Simulation Optimization

0 references

Two-Point Step Size Gradient Methods

0 references

A derivative-free comirror algorithm for convex optimization

0 references

0 references

New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates

0 references

Mixed-integer nonlinear optimization

0 references

Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods

0 references

Robust optimization with simulated annealing

0 references

Robust Optimization for Unconstrained Simulation-Based Problems

0 references

Stochastic recursive algorithms for optimization. Simultaneous perturbation methods

0 references

Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression

0 references

Global optimization of costly nonconvex functions using radial basis functions

0 references

Approximation Methods which Converge with Probability one

0 references

Multidimensional Stochastic Approximation Methods

0 references

A stochastic method for global optimization

0 references

Generalized pattern search methods for a class of nonsmooth optimization problems with structure

0 references

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

0 references

A New Method of Constrained Optimization and a Comparison With Other Methods

0 references

A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems

0 references

Constrained optimization involving expensive function evaluations: A sequential approach

0 references

0 references

Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation

0 references

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

0 references

Kernel-based methods for bandit convex optimization

0 references

0 references

Lipschitz Bandits without the Lipschitz Constant

0 references

Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints

0 references

0 references

Convergence rates of efficient global optimization algorithms

0 references

Mesh adaptive direct search with second directional derivative-based Hessian update

0 references

Grid restrained Nelder-Mead algorithm

0 references

Algorithms for noisy problems in gas transmission pipeline optimization

0 references

A derivative-free Gauss-Newton method

0 references

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models

0 references

Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers

0 references

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

0 references

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

0 references

0 references

Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization

0 references

Stochastic optimization using a trust-region method and random models

0 references

Optimization with hidden constraints and embedded Monte Carlo computations

0 references

A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization

0 references

Superlinear Convergence and Implicit Filtering

0 references

Optimization of automotive valve train components with implicit filtering

0 references

Derivative-free robust optimization for circuit design

0 references

An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints

0 references

Exploiting band structure in unconstrained optimization without derivatives

0 references

Optimizing partially separable functions without derivatives

0 references

A trust-region derivative-free algorithm for constrained optimization

0 references

Global convergence of trust-region algorithms for convex constrained minimization without derivatives

0 references

Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

0 references

0 references

Bilevel derivative-free optimization and its application to robust optimization

0 references

A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds

0 references

Trust Region Methods

0 references

0 references

Recent progress in unconstrained nonlinear optimization without derivatives

0 references

Geometry of interpolation sets in derivative free optimization

0 references

Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation

0 references

Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points

0 references

Introduction to Derivative-Free Optimization

0 references

Frame based methods for unconstrained optimization

0 references

Efficient calculation of regular simplex gradients

0 references

GLODS: global and local optimization using direct search

0 references

MultiGLODS: global and local multiobjective optimization using direct search

0 references

Using Sampling and Simplex Derivatives in Pattern Search Methods

0 references

Using simplex gradients of nonsmooth functions in direct search methods

0 references

Direct Multisearch for Multiobjective Optimization

0 references

Incorporating minimum Frobenius norm models in direct search

0 references

MILP models for the selection of a small set of well-distributed points

0 references

Theory of Positive Linear Dependence

0 references

Exploiting Known Structures to Approximate Normal Cones

0 references

Stopping criteria for linesearch methods without derivatives

0 references

Variable-number sample-path optimization

0 references

Direct Search Methods on Parallel Machines

0 references

An Application of Chung's Lemma to the Kiefer-Wolfowitz Stochastic Approximation Procedure

0 references

Derivative-free methods for nonlinear programming with general lower-level constraints

0 references

A derivative-free nonmonotone line-search technique for unconstrained optimization

0 references

Worst case complexity of direct search under convexity

0 references

On the optimal order of worst case complexity of direct search

0 references

On the Local Convergence of Pattern Search

0 references

Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations

0 references

0 references

An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization

0 references

An inexact restoration derivative-free filter method for nonlinear programming

0 references

Multicriteria Optimization

0 references

A grid algorithm for bound constrained optimization of noisy functions

0 references

0 references

A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization

0 references

On the geometry phase in model-based algorithms for derivative-free optimization

0 references

Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming

0 references

Additive scaling and the \texttt{DIRECT} algorithm

0 references

0 references

0 references

Function Minimization Without Evaluating Derivatives--a Review

0 references

0 references

Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23--27, 2012.

0 references

Coordinate search algorithms in multilevel optimization

0 references

A generating set search method using curvature information

0 references

Implementing the Nelder-Mead simplex algorithm with adaptive parameters

0 references

New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization

0 references

On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

0 references

Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization

0 references

Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case

0 references

Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case

0 references

0 references

Conditional gradient type methods for composite nonlinear and stochastic optimization

0 references

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

0 references

0 references

Computing Forward-Difference Intervals for Numerical Optimization

0 references

An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima

0 references

Sequential Search: A Method for Solving Constrained Optimization Problems

0 references

A Globally Convergent Filter Method for Nonlinear Programming

0 references

Nonlinear programming without a penalty function or a filter

0 references

0 references

A derivative-free trust-region algorithm for composite nonsmooth optimization

0 references

A Merit Function Approach for Direct Search

0 references

A second-order globally convergent direct-search method and its worst-case complexity

0 references

A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds

0 references

Direct Search Based on Probabilistic Descent

0 references

Complexity and global rates of trust-region methods based on probabilistic models

0 references

Direct search based on probabilistic feasible descent for bound and linearly constrained problems

0 references

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization

0 references

0 references

A mathematical view of automatic differentiation

0 references

Evaluating Derivatives

0 references

On Lipschitz optimization based on gray-box piecewise linearization

0 references

A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations

0 references

Nonmonotone derivative-free methods for nonlinear equations

0 references

Global convergence and stabilization of unconstrained minimization methods without derivatives

0 references

A derivative-free algorithm for linearly constrained optimization problems

0 references

Stochastic finite element methods for partial differential equations with random input data

0 references

A radial basis function method for global optimization

0 references

On the convergence of the UOBYQA method

0 references

On the Number of Iterations of Piyavskii's Global Optimization Algorithm

0 references

Numerical Analysis of $\mathcal{V}\mathcal{U}$-Decomposition, $\mathcal{U}$-Gradient, and $\mathcal{U}$-Hessian Approximations

0 references

Compositions of convex functions and fully linear models

0 references

Estimating Tangent and Normal Cones Without Calculus

0 references

Derivative-free optimization via proximal point methods

0 references

Derivative-free optimization methods for finite minimax problems

0 references

A derivative-free approximate gradient sampling algorithm for finite minimax problems

0 references

A derivative-free 𝒱𝒰-algorithm for convex finite-max problems

0 references

Design and implementation of a massively parallel version of DIRECT

0 references

0 references

`` Direct Search'' Solution of Numerical and Statistical Problems

0 references

A Class of Trust-Region Methods for Parallel Optimization

0 references

Asynchronous Parallel Pattern Search for Nonlinear Optimization

0 references

Global optimization by multilevel coordinate search

0 references

Lipschitzian optimization without the Lipschitz constant

0 references

Efficient global optimization of expensive black-box functions

0 references

Convergence estimates for iterative minimization methods

0 references

Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

0 references

0 references

0 references

Implicit Filtering

0 references

Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components

0 references

Stochastic Estimation of the Maximum of a Regression Function

0 references

A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

0 references

0 references

Simulation-Based Optimization with Stochastic Approximation Using Common Random Numbers

0 references

Stationarity Results for Generating Set Search for Linearly Constrained Optimization

0 references

0 references

0 references

Rates of Convergence for Stochastic Approximation Type Algorithms

0 references

A projected derivative-free algorithm for nonlinear equations with convex constraints

0 references

Spectral residual method without gradient information for solving large-scale nonlinear systems of equations

0 references

Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions

0 references

Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions

0 references

Asymptotically efficient adaptive allocation rules

0 references

Stochastic derivative-free optimization using a trust region framework

0 references

A batch, derivative-free algorithm for finding multiple local minima

0 references

Asynchronously parallel optimization solver for finding multiple minima

0 references

A method for convex black-box integer global optimization

0 references

Manifold Sampling for $\ell_1$ Nonconvex Optimization

0 references

Derivative free methodologies for circuit worst case analysis

0 references

Calibration by optimization without using derivatives

0 references

0 references

Budget-Dependent Convergence Rate of Stochastic Approximation

0 references

0 references

0 references

A method for the solution of certain non-linear problems in least squares

0 references

Pattern Search Algorithms for Bound Constrained Minimization

0 references

Pattern Search Methods for Linearly Constrained Minimization

0 references

A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds

0 references

Direct search methods: Then and now

0 references

A derivative-free line search and global convergence of Broyden-like method for nonlinear equations

0 references

A class of derivative-free methods for large-scale nonlinear monotone equations

0 references

MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems

0 references

A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function

0 references

Derivative-free methods for bound constrained mixed-integer optimization

0 references

Derivative-free methods for mixed-integer constrained optimization problems

0 references

A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization

0 references

An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables

0 references

A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems

0 references

Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization

0 references

A derivative-free algorithm for bound constrained optimization

0 references

On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization

0 references

Objective-derivative-free methods for constrained optimization

0 references

Pattern search methods for finite minimax problems

0 references

0 references

A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling

0 references

Wedge trust region method for derivative free optimization.

0 references

An Algorithm for Least-Squares Estimation of Nonlinear Parameters

0 references

Constrained derivative-free optimization on thin domains

0 references

Random optimization

0 references

Solving Nonlinear Programs Without Using Analytic Derivatives

0 references

Positive Bases for Linear Spaces

0 references

Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point

0 references

Derivative-free robust optimization by outer approximations

0 references

Direct search algorithm for bilevel programming problems

0 references

A superlinearly convergent algorithm for minimization without evaluating derivatives

0 references

0 references

0 references

Computing a Trust Region Step

0 references

Benchmarking Derivative-Free Optimization Algorithms

0 references

Estimating Computational Noise

0 references

Estimating Derivatives of Noisy Simulations

0 references

Do you trust derivatives or differences?

0 references

Approximate norm descent methods for constrained nonlinear systems

0 references

MISO: mixed-integer surrogate optimization framework

0 references

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints

0 references

GOSAC: global optimization with surrogate approximation of constraints

0 references

SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications

0 references

SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems

0 references

A multigrid approach to discretized optimization problems

0 references

Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search

0 references

A Simplex Method for Function Minimization

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Random gradient-free minimization of convex functions

0 references

Complete search in continuous global optimization and constraint satisfaction

0 references

A trust-region-based derivative free algorithm for mixed integer programming

0 references

A Stochastic Line Search Method with Expected Complexity Analysis

0 references

On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization

0 references

On Sampling Rates in Simulation-Based Recursions

0 references

Pure adaptive search in Monte Carlo optimization

0 references

A New Method for Minimising a Sum of Squares without Calculating Gradients

0 references

Precision Control for Generalized Pattern Search Algorithms with Adaptive Precision Function Evaluations

0 references

BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables

0 references

An efficient method for finding the minimum of a function of several variables without calculating derivatives

0 references

A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives

0 references

A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives

0 references

0 references

0 references

0 references

0 references

On the Lagrange functions of quadratic models that are defined by interpolation<sup>*</sup>

0 references

UOBYQA: unconstrained optimization by quadratic approximation

0 references

On trust region methods for unconstrained minimization without derivatives

0 references

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions

0 references

On the use of quadratic models in unconstrained minimization without derivatives

0 references

0 references

Developments of NEWUOA for minimization without derivatives

0 references

On the convergence of a wide range of trust region methods for unconstrained optimization

0 references

On the convergence of trust region algorithms for unconstrained minimization without derivatives

0 references

Beyond symmetric Broyden for updating quadratic models in minimization without derivatives

0 references

On fast trust region methods for quadratic models with linear constraints

0 references

0 references

Exploiting problem structure in pattern search methods for unconstrained optimization

0 references

A convergent variant of the Nelder--Mead algorithm

0 references

Dud, A Derivative-Free Algorithm for Nonlinear Least Squares

0 references

The calculus of simplex gradients

0 references

On the properties of positive spanning sets and positive bases

0 references

A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions

0 references

CONORBIT: constrained optimization by radial basis function interpolation in trust regions

0 references

Stochastic global optimization methods part I: Clustering methods

0 references

Stochastic global optimization methods part II: Multi level methods

0 references

Derivative-free optimization: a review of algorithms and comparison of software implementations

0 references

Some aspects of the sequential design of experiments

0 references

A Stochastic Approximation Method

0 references

Variational Analysis

0 references

0 references

Simplex direct search algorithms

0 references

A Derivative-Free Trust-Region Method for Biobjective Optimization

0 references

Asymptotic Distribution of Stochastic Approximation Procedures

0 references

A derivative-free trust-funnel method for equality-constrained nonlinear optimization

0 references

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints

0 references

A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation

0 references

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

0 references

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback

0 references

ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization

0 references

Multivariate stochastic approximation using a simultaneous perturbation gradient approximation

0 references

Introduction to Stochastic Search and Optimization

0 references

0 references

Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation

0 references

Pattern search ranking and selection algorithms for mixed variable simulation-based optimization

0 references

Optimization of Convex Functions with Random Pursuit

0 references

On the Convergence of the Multidirectional Search Algorithm

0 references

On the Convergence of Pattern Search Algorithms

0 references

Global optimization

0 references

A sequential quadratic programming algorithm for equality-constrained optimization without derivatives

0 references

Fortified-Descent Simplicial Search Method: A General Approach

0 references

Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions

0 references

CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm

0 references

On the construction of quadratic models for derivative-free trust-region algorithms

0 references

Worst case complexity of direct search

0 references

Analysis of direct searches for discontinuous functions

0 references

Surrogate‐based methods for black‐box optimization

0 references

Scattered Data Approximation

0 references

Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms

0 references

Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization

0 references

ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions

0 references

Function Minimization by Interpolation in a Data Table

0 references

0 references

Algebraic multigrid methods

0 references

Conditions for convergence of trust region algorithms for nonsmooth optimization

0 references

Pure adaptive search in global optimization

0 references

Bilevel direct search method for leader-follower problems and application in health insurance

0 references

On the local convergence of a derivative-free algorithm for least-squares minimization

0 references

A Derivative-Free Algorithm for Least-Squares Minimization

0 references

Sobolev seminorm of quadratic functions with applications to derivative-free optimization

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0962492919000060

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

journals/actanum/LarsonMW19

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5230522

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5230522&oldid=37910947"