Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
type: Item
instance of: scholarly article
title: Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
zbMATH Open document ID: 1383.90025
author: Magnus Önnheim
author: Emil Gustavsson
author: Ann-Brith Strömberg
author: Michael Patriksson
author: Torbjörn Larsson
published in: Mathematical Programming. Series A. Series B
publication date: 2017-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6715562
zbMATH Keywords: inconsistent convex program
zbMATH Keywords: Lagrange dual
zbMATH Keywords: homogeneous Lagrangian function
zbMATH Keywords: subgradient algorithm
zbMATH Keywords: ergodic primal sequence
MaRDI profile type: Publication
Wikidata QID: Q59611508
full work available at URL: s10107-016-1055-x
OpenAlex ID: W2472896993
cites work: Two ``well-known'' properties of subgradient optimization
cites work: Nonlinear Programming
cites work: Q3151174
cites work: Steering exact penalty methods for nonlinear programming
cites work: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
cites work: Q3186414
cites work: The smallest correction of an inconsistent system of linear inequalities
cites work: Q3911002
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: Primal convergence from dual subgradient methods for convex optimization
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q3141900
cites work: A bundle-filter method for nonsmooth convex constrained optimization
cites work: Approximations in proximal bundle methods and decomposition of convex programs
cites work: Lagrangian Relaxation via Ballstep Subgradient Methods
cites work: Q3231324
cites work: Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
cites work: Conditional subgradient optimization -- theory and applications
cites work: Ergodic convergence in subgradient optimization
cites work: Ergodic, primal convergence in dual subgradient schemes for convex programming
cites work: On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
cites work: Ergodic convergence in subgradient optimization with application to simplical decomposition of convex programs
cites work: Q4735938
cites work: New variants of bundle methods
cites work: A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
cites work: Q4040221
cites work: Primal-dual subgradient methods for convex problems
cites work: A filter-variable-metric method for nonsmooth convex constrained optimization
cites work: Q5566712
cites work: Minimization of unsmooth functionals
cites work: Convex Analysis
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
cites work: Q5187067
DOI: 10.1007/S10107-016-1055-X
description: scientific article; zbMATH DE number 6715562