UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 846

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

Link zum Volltext

Verfügbarkeit prüfen

A practical algorithm for completing half-Hadamard matrices using LLL

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

2022

Link zum Volltext

Verfügbarkeit prüfen

The Quaternion LMS Algorithm for Adaptive Filtering of Hypercomplex Processes

IEEE transactions on signal processing, 2009-04, Vol.57 (4), p.1316-1327

2009

Link zum Volltext
IEEE_Xplore

Selection of the Best Model of Distribution of Measurement Points in Contact Coordinate Measurements of Free-Form Surfaces of Products

Sensors (Basel, Switzerland), 2019-12, Vol.19 (24), p.5346

Magdziak, Marek

2019

Link zum Volltext

Verfügbarkeit prüfen

On Lagrangian Relaxation of Quadratic Matrix Constraints

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

2000

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

Quartic First-Order Methods for Low-Rank Minimization

Journal of optimization theory and applications, 2021-05, Vol.189 (2), p.341-363

2021

Link zum Volltext

Verfügbarkeit prüfen

Convex Sparse PCA for Unsupervised Feature Learning

ACM transactions on knowledge discovery from data, 2016-08, Vol.11 (1), p.1-16

2016

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems

Journal of optimization theory and applications, 2022-03, Vol.192 (3), p.830-855

2022

Link zum Volltext

Verfügbarkeit prüfen

Expanding the validity of the ensemble Kalman filter without the intrinsic need for inflation

Nonlinear processes in geophysics, 2015-11, Vol.22 (6), p.645-662

2015

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

The Global Optimization Geometry of Shallow Linear Neural Networks

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

2020

Link zum Volltext

Verfügbarkeit prüfen

Separation and relaxation for cones of quadratic forms

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

2013

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

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

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

2019

Link zum Volltext

Verfügbarkeit prüfen

Time-Domain and Monostatic-like Frequency-Domain Methods for Bistatic SAR Simulation

Sensors (Basel, Switzerland), 2021-07, Vol.21 (15), p.5012

2021

Link zum Volltext

Verfügbarkeit prüfen

Two Efficient Algorithms for Orthogonal Nonnegative Matrix Factorization

Mathematical problems in engineering, 2021-07, Vol.2021, p.1-13

2021

Link zum Volltext

Verfügbarkeit prüfen

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

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

2021

Link zum Volltext

Verfügbarkeit prüfen

Projected Affinity Values for Nyström Spectral Clustering

Entropy (Basel, Switzerland), 2018-07, Vol.20 (7), p.519

2018

Link zum Volltext

Verfügbarkeit prüfen

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

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

2011

Link zum Volltext

Verfügbarkeit prüfen

Local Discontinuous Galerkin Methods for the Boussinesq Coupled BBM System

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

2018

Link zum Volltext

Verfügbarkeit prüfen

Time series-based SHM using PCA with application to ASCE benchmark structure

Journal of civil structural health monitoring, 2020-11, Vol.10 (5), p.899-911

2020

Link zum Volltext

Verfügbarkeit prüfen

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

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 846

Suche als RSS-Feed

Aktive Filter

KollektionScienceDirect Journals

ThemaAlgorithms

KollektionTaylor & Francis

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(785)
Mit Volltextzugriff
(802)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(740)
Technology
(471)
Physical Sciences
(402)
Mathematics
(314)
Computer Science
(269)
Engineering
(247)
Mathematics, Applied
(193)
Optimization
(188)
Methods
(146)
Mathematical Models
(140)
Mathematical Analysis
(118)
Studies
(118)
Life Sciences & Biomedicine
(115)
Mathematics And Statistics
(112)
Machine Learning
(108)
Engineering, Electrical & Electronic
(106)
Artificial Intelligence
(101)
Approximation
(95)
Neural Networks
(95)

14 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(2)
... seit 90 Tagen
(5)

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

The Quaternion LMS Algorithm for Adaptive Filtering of Hypercomplex Processes

Selection of the Best Model of Distribution of Measurement Points in Contact Coordinate Measurements of Free-Form Surfaces of Products

On Lagrangian Relaxation of Quadratic Matrix Constraints

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

Quartic First-Order Methods for Low-Rank Minimization

Convex Sparse PCA for Unsupervised Feature Learning

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

An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems

Expanding the validity of the ensemble Kalman filter without the intrinsic need for inflation

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

The Global Optimization Geometry of Shallow Linear Neural Networks

Separation and relaxation for cones of quadratic forms

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

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

Time-Domain and Monostatic-like Frequency-Domain Methods for Bistatic SAR Simulation

Two Efficient Algorithms for Orthogonal Nonnegative Matrix Factorization

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

Projected Affinity Values for Nyström Spectral Clustering

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

Local Discontinuous Galerkin Methods for the Boussinesq Coupled BBM System

Time series-based SHM using PCA with application to ASCE benchmark structure

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

Aktive Filter

Suchergebnisse filtern