Pages that link to "Item:Q959941"

The following pages link to Computing proximal points of nonconvex functions (Q959941):

Displaying 49 items.

• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• Joint estimation and variable selection for mean and dispersion in proper dispersion models (Q309529) (← links)
• Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
• Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
• Optimality, identifiability, and sensitivity (Q463741) (← links)
• Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
• Primal-lower-nice property of value functions in optimization and control problems (Q618890) (← links)
• Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
• The Moreau envelope function and proximal mapping in the sense of the Bregman distance (Q654077) (← links)
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
• On Chebyshev functions and Klee functions (Q972484) (← links)
• Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds (Q975855) (← links)
• An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
• A decomposition method with redistributed subroutine for constrained nonconvex optimization (Q1949452) (← links)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
• Solving mixed variational inequalities beyond convexity (Q2046698) (← links)
• An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
• On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• On convex envelopes and regularization of non-convex functionals without moving global minima (Q2275270) (← links)
• Derivative-free robust optimization by outer approximations (Q2288189) (← links)
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
• Minimization of non-smooth, non-convex functionals by iterative thresholding (Q2346390) (← links)
• Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem (Q2514069) (← links)
• A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
• Trimmed Statistical Estimation via Variance Reduction (Q5108267) (← links)
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates (Q5119852) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• One-Step Estimation with Scaled Proximal Methods (Q5868961) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
• Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities (Q6099480) (← links)
• Proximal variable metric method with spectral diagonal update for large scale sparse optimization (Q6099831) (← links)
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← links)
• A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection (Q6176000) (← links)