A new boosted proximal point algorithm for minimizing nonsmooth DC functions

DOI10.1080/01630563.2022.2109171MaRDI QIDQ5099775zbMATH OpenOpenAlexWikidataFDO

Authors Amir Hamzeh Alizadeh Tabrizian, Narges Bidabadi

Publication date 26 August 2022

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630563.2022.2109171

zbMATH Keywords

DC functionKurdyka-Łojasiewicz propertyline searchproximal point algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48)

Recommendations

• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• scientific article; zbMATH DE number 2076851
• An accelerated proximal algorithm for the difference of convex programming

Cites work

• A generalized proximal point algorithm for certain non-convex minimization problems
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A minimization method for the sum of a convex function and a continuously differentiable function
• A modified proximal point method for DC functions on Hadamard manifolds
• A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
• A proximal point algorithm for DC functions on Hadamard manifolds
• Accelerating the DC algorithm for smooth functions
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Clarke Subgradients of Stratifiable Functions
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Finite termination of the proximal point algorithm
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Gradient methods for minimizing composite functions
• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 1282147 (Why is no real title available?)
• scientific article; zbMATH DE number 1290200 (Why is no real title available?)
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3359250 (Why is no real title available?)
• scientific article; zbMATH DE number 3381034 (Why is no real title available?)
• Introduction to global optimization
• Introductory lectures on convex optimization. A basic course.
• Iterative Refinement in Floating Point
• Minimizing a differentiable function over a differential manifold
• Monotone Operators and the Proximal Point Algorithm
• Note on the iterative refinement of least squares solution
• Numerical Optimization
• On the contraction-proximal point algorithms with multi-parameters
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal splitting methods in signal processing
• Qualitative properties of the minimum sum-of-squares clustering problem
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Variational Analysis

Cited in

(18)

• Accelerating the DC algorithm for smooth functions
• Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
• The modified second APG method for DC optimization problems
• Aggregate codifferential method for nonsmooth DC optimization
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• The boosted DC algorithm for linearly constrained DC programming
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• A new proximal algorithm for unconstrained nonconvex optimization problems
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• Codifferential method for minimizing nonsmooth DC functions
• New Bregman proximal type algoritms for solving DC optimization problems
• Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
• An accelerated proximal algorithm for the difference of convex programming
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search
• The boosted double-proximal subgradient algorithm for nonconvex optimization

This page was built for publication: A new boosted proximal point algorithm for minimizing nonsmooth DC functions

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