A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
From MaRDI portal
Publication:2158622
DOI10.1007/s10479-018-3104-8zbMath1496.90065WikidataQ128876069 ScholiaQ128876069MaRDI QIDQ2158622
Antoine Soubeyran, João Carlos O. Souza, João Xavier da Cruz Neto, Paulo Roberto Oliveira
Publication date: 26 July 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal-amu.archives-ouvertes.fr/hal-01985336/file/Joao%20Carlos%20Opt%20size%20of%20the%20firm.pdf
proximal point method; Kurdyka-Łojasiewicz inequality; DC function; variational rationality; limit of the firm
Related Items
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, General descent method using w-distance. Application to emergence of habits following worthwhile moves, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, The ABC of DC programming, Variational rationality, variational principles and the existence of traps in a changing environment, A modified proximal point method for DC functions on Hadamard manifolds, Proximal bundle methods for nonsmooth DC programming, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Abstract regularized equilibria: application to Becker's household behavior theory, A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires, An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- 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
- On functions representable as a difference of convex functions
- Partial quasi-metrics
- A proximal point algorithm for DC functions on Hadamard manifolds
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Computing proximal points of nonconvex functions
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Proximal point methods and nonconvex optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Applications of utility functions defined on quasi-metric spaces
- Recursive quasi-metric spaces.
- Variational principles, completeness and the existence of traps in behavioral sciences
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Variational analysis in psychological modeling
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Generalized Proximal Distances for Bilevel Equilibrium Problems
- Variational principles with generalized distances and the modelization of organizational change
- Strong and Weak Convexity of Sets and Functions
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- On difference convexity of locally Lipschitz functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A proximal algorithm with quasi distance. Application to habit's formation
- One step from DC optimization to DC mixed variational inequalities
- Critical Point Approximation Through Exact Regularization
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- The Concave-Convex Procedure
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Proximal Decomposition Via Alternating Linearization
- Nonsmooth sequential analysis in Asplund spaces
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
