Computing proximal points of nonconvex functions
From MaRDI portal
Recommendations
- Proximal point methods and nonconvex optimization
- Computing proximal points of convex functions with inexact subgradients
- Non-Convex feasibility problems and proximal point methods
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Proximal determination of convex functions
- Proximal point algorithms and generalized nonlinear variational problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Proximal point algorithms for zero points of nonlinear operators
- Proximal point nonlinear rescaling method for convex optimization
- A proximal iterative approach to a non-convex optimization problem
Cites work
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3791548 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 3237318 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A family of variable metric proximal methods
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Benchmarking optimization software with performance profiles.
- Convergence of some algorithms for convex minimization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Penalty-proximal methods in convex programming
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Prox-regular functions in Hilbert spaces
- Prox-regular functions in variational analysis
- Prox-regularity of functions and sets in Banach spaces
- Proximité et dualité dans un espace hilbertien
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Variable metric bundle methods: From conceptual to implementable forms
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(74)- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- Nonconvex bundle method with application to a delamination problem
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- Strongly quasiconvex functions: what we know (so far)
- Primal-lower-nice property of value functions in optimization and control problems
- Proximal point method for a special class of nonconvex functions on Hadamard manifolds
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions
- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- Solving mixed variational inequalities beyond convexity
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- One-Step Estimation with Scaled Proximal Methods
- Algorithmic Applications in Management
- Global convergence of splitting methods for nonconvex composite optimization
- Newton acceleration on manifolds identified by proximal gradient methods
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- Harnessing Structure in Composite Nonsmooth Minimization
- Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Joint estimation and variable selection for mean and dispersion in proper dispersion models
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Proximal algorithms for a class of abstract convex functions
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- An extension of the proximal point algorithm beyond convexity
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Computing proximal points of convex functions with inexact subgradients
- Derivative-free robust optimization by outer approximations
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Optimality, identifiability, and sensitivity
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Forward-backward algorithms for weakly convex problems
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Proximal point algorithms for zero points of nonlinear operators
- Local search proximal algorithms as decision dynamics with costs to move
- On Chebyshev functions and Klee functions
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Global convergence of a proximal linearized algorithm for difference of convex functions
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- Non-Convex feasibility problems and proximal point methods
- A proximal alternating linearization method for nonconvex optimization problems
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A splitting bundle approach for non-smooth non-convex minimization
- A decomposition method with redistributed subroutine for constrained nonconvex optimization
- A proximal iterative approach to a non-convex optimization problem
- Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points
- Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities
- Active-set Newton methods and partial smoothness
- MirrorCBO: a consensus-based optimization method in the spirit of mirror descent
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection
- Derivative-free optimization via proximal point methods
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- A Bregman proximal point algorithm without convexity in Banach spaces
- Characterizing firm nonexpansiveness of prox mappings both locally and globally
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Trimmed statistical estimation via variance reduction
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Partial smoothness and constant rank
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for publication: Computing proximal points of nonconvex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959941)
