On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format

SIAM Journal on Numerical Analysis - United States
doi 10.1137/110857520
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Computation of Extreme Eigenvalues in Higher Dimensions Using Block Tensor Train Format

Computer Physics Communications
HardwareAstronomyPhysicsArchitecture
2014English

Implementable Tensor Methods in Unconstrained Convex Optimization

Mathematical Programming, Series B
MathematicsSoftware
2019English

Iterative Schemes for Convex Minimization Problems With Constraints

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

H-Convergence and Numerical Schemes for Elliptic Problems

SIAM Journal on Numerical Analysis
Computational MathematicsApplied MathematicsNumerical Analysis
2003English

Convergence of Generalized Entropy Minimizers in Sequences of Convex Problems

2016English

Convex Methods for Rank-Constrained Optimization Problems

2015English

On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

Global Convergence of the TMR Method for Unconstrained Optimization Problems

Communications in Applied Analysis
ModelingApplied MathematicsNumerical AnalysisAnalysisSimulation
2017English

Some Optimization Problems for the Minimal Annulus of a Convex Set

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy