Dual descent methods as tension reduction systems

DOI10.1007/S10957-016-0994-YzbMATH Open1351.90152OpenAlexW2513579876MaRDI QIDQ727232FDOQ727232

Antoine Soubeyran, Glaydston~de Carvalho Bento, Valdinês Leite de Sousa Júnior, J. X. da Cruz Neto

Publication date: 6 December 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0994-y

zbMATH Keywords

inexact proximalKurdyka-Lojasiewicz propertydual descenttension systemsvariational rationalityworthwhile change

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods involving duality (49M29)

Cites Work

• Title not available (Why is that?)
• Variational Analysis
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Geometric categories and o-minimal structures
• Clarke Subgradients of Stratifiable Functions
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• On gradients of functions definable in o-minimal structures
• Weak Sharp Minima on Riemannian Manifolds
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Proof of the gradient conjecture of R. Thom.
• A new approach to the proximal point method: convergence on general Riemannian manifolds
• A proximal algorithm with quasi distance. Application to habit's formation
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Pointwise convergence of gradient‐like systems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Variational analysis in psychological modeling
• A steepest descent-like method for variable order vector optimization problems
• Finite termination of the proximal point method for convex functions on Hadamard manifolds
• Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
• Descentwise inexact proximal algorithms for smooth optimization
• Convergence to equilibrium for discretized gradient-like systems with analytic features

Cited In (3)

• Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
• Maximum time step for the BDF3 scheme applied to gradient flows
• Gradient stability of high-order BDF methods and some applications

   Recommendations

• Vector Assessment of Problematic Situations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Dual techniques for constrained optimization 👍 👎
• Title not available (Why is that?) 👍 👎
• The Benders Dual Decomposition Method 👍 👎
• Title not available (Why is that?) 👍 👎
• Dual methods for discrete structural optimization problems 👍 👎
• The dual branch and bound method 👍 👎
• Dual form reduction in the atomic optimization method 👍 👎

This page was built for publication: Dual descent methods as tension reduction systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727232)