Error Bounds for Strongly Convex Programs and (Super)linearly Convergent Iterative Schemes for the Least 2-Norm Solution of Linear Programs

Applied Mathematics and Optimization - United States
doi 10.1007/bf01448356
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Proving Bounds for Real Linear Programs in Isabelle/Hol

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Multiparameter Iterative Schemes for the Solution of Systems of Linear and Nonlinear Equations

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
1999English

Euclidean-Norm Error Bounds for SYMMLQ and CG

SIAM Journal on Matrix Analysis and Applications
Analysis
2019English

A Globally Convergent Sequential Linear Programming Algorithm for Mathematical Programs With Linear Complementarity Constraints

Journal of Information and Optimization Sciences
2010English

An Evaluation of Linear Least Squares Computer Programs

Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
1969English

Bounds and Approximations for Multistage Stochastic Programs

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2016English

Lower Bounds for Monotone Span Programs

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1996English

Iterative Schemes for Convex Minimization Problems With Constraints

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

LSLQ: An Iterative Method for Linear Least-Squares With an Error Minimization Property

SIAM Journal on Matrix Analysis and Applications
Analysis
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy