Pages that link to "Item:Q4340801"
From MaRDI portal
The following pages link to Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries (Q4340801):
Displayed 50 items.
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- Composite proximal bundle method (Q359623) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions (Q871665) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- A new trust region algorithm for nonsmooth convex minimization (Q990576) (← links)
- A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053) (← links)
- Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
- Epi-convergence: the Moreau envelope and generalized linear-quadratic functions (Q1637348) (← links)
- Helping you finding an appropriate regularization process (Q1639964) (← links)
- Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription (Q1661478) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives (Q1877017) (← links)
- Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems (Q2033078) (← links)
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems (Q2095559) (← links)
- First-order inertial algorithms involving dry friction damping (Q2133421) (← links)
- Generalized greedy alternatives (Q2175011) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- Weakly constrained minimization: application to the estimation of images and signals involving constant regions (Q2273329) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
- The \(\mathcal{VU}\)-decomposition to the proper convex function (Q2379901) (← links)
- An accelerated variance reducing stochastic method with Douglas-Rachford splitting (Q2425236) (← links)
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization (Q2438407) (← links)
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization (Q2576736) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
- A modified conjugate gradient method for general convex functions (Q2699981) (← links)
- Lagrange optimality system for a class of nonsmooth convex optimization (Q2810115) (← links)
- An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function (Q3114592) (← links)
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming (Q3148378) (← links)
- Explicit formulas for 𝐶^{1,1} Glaeser-Whitney extensions of 1-Taylor fields in Hilbert spaces (Q3177856) (← links)
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
- Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions (Q4657702) (← links)
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs (Q4678764) (← links)
- The 𝒰-Lagrangian of a convex function (Q4699613) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- A Method for Minimization of Quasidifferentiable Functions (Q4806341) (← links)
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications (Q4960078) (← links)