Dual descent methods as tension reduction systems

DOI10.1007/S10957-016-0994-YMaRDI QIDQ727232zbMATH OpenOpenAlexFDO

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

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

dual descentinexact proximalKurdyka-Lojasiewicz propertytension systemsvariational rationalityworthwhile change

Mathematics Subject Classification ID

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

Recommendations

• Vector Assessment of Problematic Situations
• scientific article; zbMATH DE number 1086901
• scientific article; zbMATH DE number 4156064
• Dual techniques for constrained optimization
• scientific article; zbMATH DE number 892057
• The Benders dual decomposition method
• scientific article; zbMATH DE number 584486
• Dual methods for discrete structural optimization problems
• The dual branch and bound method
• Dual form reduction in the atomic optimization method

Cites work

• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
• A new approach to the proximal point method: convergence on general Riemannian manifolds
• A proximal algorithm with quasi distance. Application to habit's formation
• A steepest descent-like method for variable order vector optimization problems
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Clarke Subgradients of Stratifiable Functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence to equilibrium for discretized gradient-like systems with analytic features
• Descentwise inexact proximal algorithms for smooth optimization
• 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
• Geometric categories and o-minimal structures
• scientific article; zbMATH DE number 6508509 (Why is no real title available?)
• On gradients of functions definable in o-minimal structures
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Pointwise convergence of gradient‐like systems
• Proof of the gradient conjecture of R. Thom.
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Variational Analysis
• Variational analysis in psychological modeling
• Weak sharp minima on Riemannian manifolds

Cited in

(4)

• 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
• General descent method using w-distance. Application to emergence of habits following worthwhile moves

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)