Convergence of a subgradient method for computing the bound norm of matrices (Q1057619): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Intersection Cut from the Dual of the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a cutting plane method for solving concave minimization problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Integer and Concave Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave Programming Applied to a Special Class of 0-1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity Cuts and Cut Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comportement périodique des fonctions à seuil binaires et applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comportement itératif des fonctions à multiseuil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Point Behavior of Threshold Functions on a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of symmetric threshold automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a subgradient method for computing the bound norm of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave minimization over a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Maximization of a Convex Function with Linear Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Algorithms for Minimizing a Concave Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality principle for non-convex optimisation and the calculus of variations / rank
 
Normal rank

Latest revision as of 17:34, 14 June 2024

scientific article
Language Label Description Also known as
English
Convergence of a subgradient method for computing the bound norm of matrices
scientific article

    Statements

    Convergence of a subgradient method for computing the bound norm of matrices (English)
    0 references
    1984
    0 references
    For a linear map \(A: R^ n\to R^ m\), where \(R^ n\) and \(R^ m\) are endowed with norms \(\psi\) and \(\phi\), the bound norm is defined by \(S_{\phi \psi}(A)=\sup \{\phi (Ax):\psi (x)\leq 1\}.\) A subgradient method for computing \(S_{\phi \psi}\) is given and it is shown that it converges if \(\phi\) or \(\psi\) are polyhedral. The paper is written in French.
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex optimization
    0 references
    polyhedral norms
    0 references
    bound norm
    0 references
    subgradient method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references