UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 670

Sortiert nach

Outer-product-free sets for polynomial optimization and oracle-based cuts

Mathematical programming, 2020-09, Vol.183 (1-2), p.105-148

2020

Volltextzugriff (PDF)

A practical algorithm for completing half-Hadamard matrices using LLL

Journal of algebraic combinatorics, 2022-02, Vol.55 (1), p.217-244

2022

Volltextzugriff (PDF)

On Lagrangian Relaxation of Quadratic Matrix Constraints

SIAM journal on matrix analysis and applications, 2000, Vol.22 (1), p.41-55

2000

Volltextzugriff (PDF)

Error Analysis of Chebyshev-Legendre Pseudo-spectral Method for a Class of Nonclassical Parabolic Equation

Journal of scientific computing, 2012-09, Vol.52 (3), p.588-602

2012

Volltextzugriff (PDF)

Structured Matrix Nearness Problems: Theory and Algorithms

Borsdorf, Ruediger

2012

Volltextzugriff (PDF)

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

Journal of global optimization, 2017-03, Vol.67 (3), p.475-493

2017

Volltextzugriff (PDF)

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Mathematical programming, 2016-03, Vol.156 (1-2), p.161-187

2016

Volltextzugriff (PDF)

Separation and relaxation for cones of quadratic forms

Mathematical programming, 2013-02, Vol.137 (1-2), p.343-370

2013

Volltextzugriff (PDF)

The Global Optimization Geometry of Shallow Linear Neural Networks

Journal of mathematical imaging and vision, 2020-04, Vol.62 (3), p.279-292

2020

Volltextzugriff (PDF)

Geometric Buildup Algorithm for the Solution of the Distance Geometry Problem Using Least-Squares Approximation

Bulletin of mathematical biology, 2009-11, Vol.71 (8), p.1914-1933

2009

Volltextzugriff (PDF)

A fast, scalable and versatile tool for analysis of single-cell omics data

Nature methods, 2024-02, Vol.21 (2), p.217

2024

Volltextzugriff (PDF)

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

Journal of global optimization, 2019-02, Vol.73 (2), p.371-388

2019

Volltextzugriff (PDF)

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

Mathematical programming, 2011-10, Vol.129 (2), p.301-329

2011

Volltextzugriff (PDF)

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation

Numerical algorithms, 2021-10, Vol.88 (2), p.993-1024

2021

Volltextzugriff (PDF)

Analytical and numerical studies on dynamic of complexiton solution for complex nonlinear dispersive model

Mathematical methods in the applied sciences, 2024-01, Vol.47 (1), p.81-109

2024

Volltextzugriff (PDF)

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Mathematical programming, 2011-12, Vol.130 (2), p.359-413

2011

Volltextzugriff (PDF)

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Mathematical programming, 2019-11, Vol.178 (1-2), p.215-262

2019

Volltextzugriff (PDF)

Local Discontinuous Galerkin Methods for the Boussinesq Coupled BBM System

Journal of scientific computing, 2018-04, Vol.75 (1), p.536-559

2018

Volltextzugriff (PDF)

A New Highly Accurate Numerical Scheme for Benjamin–Bona–Mahony–Burgers Equation Describing Small Amplitude Long Wave Propagation

Mediterranean journal of mathematics, 2023-06, Vol.20 (3), Article 173

2023

Volltextzugriff (PDF)

Metropolis–Hastings Algorithms with acceptance ratios of nearly 1

Annals of the Institute of Statistical Mathematics, 2009-12, Vol.61 (4), p.949-967

Kamatani, Kengo

2009

Volltextzugriff (PDF)

An innovative malware detection methodology employing the amalgamation of stacked BiLSTM and CNN+LSTM‐based classification networks with the assistance of Mayfly metaheuristic optimization algorithm in cyber‐attack

Concurrency and computation, 2023-05, Vol.35 (10), p.n/a

2023

Volltextzugriff (PDF)

Conic approximation to quadratic optimization with linear complementarity constraints

Computational optimization and applications, 2017, Vol.66 (1), p.97-122

2017

Volltextzugriff (PDF)

Faster Subset Selection for Matrices and Applications

SIAM journal on matrix analysis and applications, 2013-01, Vol.34 (4), p.1464-1499

2013

Volltextzugriff (PDF)

On the use of correlation as a measure of network connectivity

NeuroImage (Orlando, Fla.), 2012-05, Vol.60 (4), p.2096-2106

2012

Volltextzugriff (PDF)

On tail dependence matrices

Extremes (Boston), 2020-06, Vol.23 (2), p.245-285

2020

Volltextzugriff (PDF)

1 – 25 von 670

Suche als RSS-Feed

Aktive Filter

Zeitschrift / SerieThe Analytical Review : Or, History Of Literature

SpracheSlowenisch

ThemaEngineering

ThemaPhysics

SpracheEnglisch

ThemaAlgorithms

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(620)
Mit Volltextzugriff
(626)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(562)
Physical Sciences
(315)
Mathematics
(295)
Technology
(279)
Computer Science
(251)
Mathematics, Applied
(201)
Optimization
(166)
Methods
(125)
Mathematics And Statistics
(116)
Artificial Intelligence
(114)
Life Sciences & Biomedicine
(111)
Machine Learning
(103)
Studies
(102)
Approximation
(94)
Mathematical Analysis
(89)
Computer Science, Artificial Intelligence
(82)
Mathematical Models
(80)
Numerical Analysis
(80)
Eigenvalues
(73)

14 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

Mathematical Programming
(31)
Neural Processing Letters
(24)
Journal Of Scientific Computing
(23)
Siam Journal On Matrix Analysis And Applications
(23)
Remote Sensing
(21)
Journal Of Global Optimization
(20)
Mathematics
(17)
Neuroimage
(17)
Scientific Reports
(15)
Numerical Algorithms
(14)

5 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(3)
... seit 90 Tagen
(8)

Menü

Weitere Dienste

Einstellungen

Outer-product-free sets for polynomial optimization and oracle-based cuts

A practical algorithm for completing half-Hadamard matrices using LLL

On Lagrangian Relaxation of Quadratic Matrix Constraints

Error Analysis of Chebyshev-Legendre Pseudo-spectral Method for a Class of Nonclassical Parabolic Equation

Structured Matrix Nearness Problems: Theory and Algorithms

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Separation and relaxation for cones of quadratic forms

The Global Optimization Geometry of Shallow Linear Neural Networks

Geometric Buildup Algorithm for the Solution of the Distance Geometry Problem Using Least-Squares Approximation

A fast, scalable and versatile tool for analysis of single-cell omics data

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation

Analytical and numerical studies on dynamic of complexiton solution for complex nonlinear dispersive model

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Local Discontinuous Galerkin Methods for the Boussinesq Coupled BBM System

A New Highly Accurate Numerical Scheme for Benjamin–Bona–Mahony–Burgers Equation Describing Small Amplitude Long Wave Propagation

Metropolis–Hastings Algorithms with acceptance ratios of nearly 1

An innovative malware detection methodology employing the amalgamation of stacked BiLSTM and CNN+LSTM‐based classification networks with the assistance of Mayfly metaheuristic optimization algorithm in cyber‐attack

Conic approximation to quadratic optimization with linear complementarity constraints

Faster Subset Selection for Matrices and Applications

On the use of correlation as a measure of network connectivity

On tail dependence matrices

Aktive Filter

Suchergebnisse filtern