scientific article; zbMATH DE number 7811224

MaRDI QIDQ6200264zbMATH OpenFDO

Authors Ba Khiet Le

Publication date 29 February 2024

Full work available at URL https://arxiv.org/abs/2311.13096, https://www.heldermann.de/JCA/JCA31/JCA311/jca31014.htm

zbMATH Keywords

convex programmingDC programmingmaximal monotone operatorsproximal point algorithmregularization

Mathematics Subject Classification ID

Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)

Cites work

• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Approximation of fixed points of nonexpansive mappings
• Calmness of constraint systems with applications
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
• Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
• Convergence of New Inertial Proximal Methods for DC Programming
• Convergence Rates in Forward--Backward Splitting
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming: overview.
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• Forcing strong convergence of proximal point iterations in a Hilbert space
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 3855514 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• scientific article; zbMATH DE number 3359250 (Why is no real title available?)
• scientific article; zbMATH DE number 3398324 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Linear convergence of first order methods for non-strongly convex optimization
• Monotone Operators and the Proximal Point Algorithm
• On the optimal linear convergence rate of a generalized proximal point algorithm
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Stability and convergence of mechanical systems with unilateral constraints
• Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• Sufficient conditions for error bounds and applications
• Well-posedness and output regulation for implicit time-varying evolution variational inequalities

Cited in

(3)

• Explicit convergence rate of the proximal point algorithm under R-continuity
• Solving non-monotone inclusions using monotonicity of pairs of operators
• Compact R-continuity with applications to solving inclusions and convergence of algorithms

This page was built for publication:

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