Pages that link to "Item:Q2866196"
From MaRDI portal
The following pages link to Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization (Q2866196):
Displaying 45 items.
- A smoothing trust region filter algorithm for nonsmooth least squares problems (Q295140) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems (Q892792) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions (Q1772966) (← links)
- Low-order penalty equations for semidefinite linear complementarity problems (Q1790191) (← links)
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
- A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299) (← links)
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
- A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions (Q2171123) (← links)
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model (Q2173566) (← links)
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
- On constrained optimization with nonconvex regularization (Q2225521) (← links)
- Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization (Q2230788) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs (Q2413100) (← links)
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities (Q2415905) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems (Q2688921) (← links)
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration (Q3454492) (← links)
- Optimality conditions for the constrained<i>L</i><sub><i>p</i></sub>-regularization (Q3454863) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms (Q5000580) (← links)
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning (Q5014628) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- (Q5053267) (← links)
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal (Q5148413) (← links)
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
- Computation of second-order directional stationary points for group sparse optimization (Q5210743) (← links)
- Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms (Q5881399) (← links)
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems (Q6097485) (← links)
- A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model (Q6111348) (← links)
- Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem (Q6586914) (← links)
