Suchergebnisse - MSC 68Q25 Analysis of algorithms AND problems complexity

The Generalized Matrix Norm Problem.

Autoren: Kulmburg, Adrian

Quelle: SIAM Journal on Matrix Analysis & Applications; 2025, Vol. 46 Issue 4, p2226-2252, 27p

Schlagwörter: MATRIX norms, POLYNOMIAL time algorithms, REPRODUCIBLE research, COMPUTABLE analysis, DUALITY theory (Mathematics), MATHEMATICAL optimization

A STOCHASTIC-GRADIENT-BASED INTERIOR-POINT ALGORITHM FOR SOLVING SMOOTH BOUND-CONSTRAINED OPTIMIZATION PROBLEMS.

Autoren: CURTIS, FRANK E. KUNGURTSEV, VYACHESLAV ROBINSON, DANIEL P. et al.

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 2, p1030-1059, 30p

Schlagwörter: INTERIOR-point methods, NONCONVEX programming, CONSTRAINT satisfaction, MATHEMATICAL programming, STOCHASTIC analysis, MATHEMATICAL optimization, EMPIRICAL research

A GRADIENT COMPLEXITY ANALYSIS FOR MINIMIZING THE SUM OF STRONGLY CONVEX FUNCTIONS WITH VARYING CONDITION NUMBERS.

Autoren: NUOZHOU WANG SHUZHONG ZHANG

Quelle: SIAM Journal on Optimization; 2024, Vol. 34 Issue 2, p1374-1401, 28p

Schlagwörter: CONVEX functions, SMOOTHNESS of functions, CONSTRAINED optimization, RESEARCH questions, EXPECTATION-maximization algorithms

ENUMERATING MINIMAL CONNECTED DOMINATING SETS.

Autoren: ABU-KHZAM, FAISAL FERNAU, HENNING GRAS, BENJAMIN et al.

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p946-972, 27p

Schlagwörter: DOMINATING set, GRAPH theory, COMPUTATIONAL complexity, NP-complete problems, COMBINATORIAL enumeration problems, MATHEMATICAL bounds

ACCELERATING PRECONDITIONED ADMM VIA DEGENERATE PROXIMAL POINT MAPPINGS.

Autoren: SUN, DEFENG YUAN, YANCHENG ZHANG, GUOJUN et al.

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 2, p1165-1193, 29p

Schlagwörter: QUADRATIC programming, CONVEX programming, ASYMPTOTIC analysis, OPTIMIZATION algorithms, NUMERICAL analysis

THE COMPLEXITY OF DIAMETER ON H-FREE GRAPHS.

Autoren: OOSTVEEN, JELLE J. PAULUSMA, DANIËL VAN LEEUWEN, ERIK JAN

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 2, p1213-1245, 33p

Schlagwörter: DIAMETER, COMPUTATIONAL complexity, TIME complexity, ALGORITHMS, GRAPH connectivity, SUBGRAPHS, GRAPH theory

Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.

Autoren: Klimm, Max Warode, Philipp

Quelle: SIAM Journal on Computing; 2025, Vol. 54 Issue 5, p1241-1293, 53p

Schlagwörter: COMPUTATIONAL complexity, EQUILIBRIUM, COST functions, TRAFFIC flow, LAPLACIAN operator, LAPLACIAN matrices

FITTING METRICS AND ULTRAMETRICS WITH MINIMUM DISAGREEMENTS.

Autoren: COHEN-ADDAD, VINCENT CHENGLIN FAN EUIWOONG LEE et al.

Quelle: SIAM Journal on Computing; 2025, Vol. 54 Issue 1, p92-133, 42p

Schlagwörter: TASK analysis, HIERARCHICAL clustering (Cluster analysis), DATA analysis, ALGORITHMS, LOGICAL prediction

ODD PATHS, CYCLES, AND T-JOINS: CONNECTIONS AND ALGORITHMS.

Autoren: SCHLOTTER, ILDIKO SEBŐ, ANDRAS

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 1, p484-504, 21p

Schlagwörter: COMBINATORIAL optimization, GRAPH theory, NP-hard problems, UNDIRECTED graphs, CUTTING stock problem

DENSITY-BASED CLUSTERING IN MAPREDUCE WITH GUARANTEES ON PARALLEL TIME, SPACE, AND SOLUTION QUALITY.

Autoren: AGHAMOLAEI, SEPIDEH GHODSI, MOHAMMAD

Quelle: Transactions on Combinatorics; Sep2025, Vol. 14 Issue 3, p135-156, 22p

Schlagwörter: GRAPH connectivity, ALGORITHMS, MACHINERY

Grassmannian Optimization Is NP-Hard.

Autoren: Lai, Zehua Lim, Lek-Heng Ye, Ke

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 3, p1939-1962, 24p

Schlagwörter: NP-hard problems, QUADRATIC programming, RIEMANNIAN manifolds, APPROXIMATION algorithms, UNITARY groups

MIXED PRECISION HODLR MATRICES.

Autoren: CARSON, ERIN XINYE CHEN XIAOBO LIU

Quelle: SIAM Journal on Scientific Computing; 2025, Vol. 47 Issue 3, pA1408-A1435, 28p

Schlagwörter: COMPUTATIONAL complexity, APPROXIMATION error, MATRIX decomposition, NUMERICAL analysis, MATRIX multiplications, NUMERICAL calculations, LOW-rank matrices

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptions.

Autoren: HanQin Cai Zehan Chao Longxiu Huang et al.

Quelle: SIAM Journal on Imaging Sciences; 2024, Vol. 17 Issue 1, p225-247, 23p

Schlagwörter: PRINCIPAL components analysis, CORRUPTION, COMPUTATIONAL complexity, OUTLIER detection

ON THE PARAMETERIZED COMPLEXITY OF DELETION TO H-FREE STRONG COMPONENTS.

Autoren: NEOGI, RIAN RAMANUJAN, M. S. SAURABH, SAKET et al.

Quelle: SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 4, p3079-3110, 32p

Schlagwörter: CONFERENCES & conventions, SUBGRAPHS, INTEGERS, ALGORITHMS, GENERALIZATION

WORST-CASE COMPLEXITY OF TRACE WITH INEXACT SUBPROBLEM SOLUTIONS FOR NONCONVEX SMOOTH OPTIMIZATION.

Autoren: CURTIS, FRANK E. QI WANG

Quelle: SIAM Journal on Optimization; 2023, Vol. 33 Issue 3, p2191-2221, 31p

Schlagwörter: NONSMOOTH optimization, PROBLEM solving, ALGORITHMS

TS-RSR: A Provably Efficient Approach for Batch Bayesian Optimization.

Autoren: Ren, Zhaolin Li, Na

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 3, p2155-2181, 27p

Schlagwörter: BENCHMARK problems (Computer science), OPTIMIZATION algorithms, MONTE Carlo method, ADAPTIVE sampling (Statistics)

Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization.

Autoren: Abdolali, Maryam Barbarino, Giovanni Gillis, Nicolas

Quelle: SIAM Journal on Imaging Sciences; 2024, Vol. 17 Issue 4, p2362-2391, 30p

Schlagwörter: MATRIX decomposition, NONNEGATIVE matrices, DATA analysis, DATA modeling, ALGORITHMS

HARDNESS OF RANDOM OPTIMIZATION PROBLEMS FOR BOOLEAN CIRCUITS, LOW-DEGREE POLYNOMIALS, AND LANGEVIN DYNAMICS.

Autoren: GAMARNIK, DAVID JAGANNATH, AUKOSH WEIN, ALEXANDER S.

Quelle: SIAM Journal on Computing; 2024, Vol. 53 Issue 1, p1-46, 46p

Schlagwörter: LOGIC circuits, GRAPH theory, CIRCUIT complexity, STOCHASTIC differential equations, SPARSE graphs, RANDOM graphs, HAMILTONIAN graph theory

Understanding the Influence of Digraphs on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal Algorithm.

Autoren: Liang, Liyuan Huang, Xinmeng Xin, Ran et al.

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 3, p1570-1600, 31p

Schlagwörter: DIRECTED graphs, MATHEMATICAL optimization, STOCHASTIC analysis, SKEWNESS (Probability theory)

ON SPECTRAL AND NUCLEAR NORMS OF ORDER THREE TENSORS WITH ONE FIXED DIMENSION.

Quelle: SIAM Journal on Matrix Analysis & Applications; 2025, Vol. 46 Issue 1, p210-231, 22p

Schlagwörter: SCHWARZ inequality, POLYNOMIAL time algorithms, RANDOM numbers, INVERSE problems, APPLIED mathematics, SEMIDEFINITE programming, INTERIOR-point methods, SINGULAR value decomposition, POLYTOPES