Pages that link to "Item:Q2866204"

The following pages link to Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization (Q2866204):

Displaying 34 items.

• 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)
• An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
• A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
• \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• Convergence analyses on sparse feedforward neural networks via group lasso regularization (Q2292940) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• A residual-based algorithm for solving a class of structured nonsmooth optimization problems (Q2301184) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities (Q2415905) (← links)
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery (Q2419553) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063) (← links)
• Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
• Linearly Constrained Non-Lipschitz Optimization for Image Restoration (Q3454492) (← links)
• Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients (Q4594856) (← links)
• A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm (Q5043740) (← links)
• (Q5053267) (← links)
• A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
• Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems (Q5146825) (← links)
• Smoothing quadratic regularization method for hemivariational inequalities (Q5151500) (← links)
• A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model (Q6111348) (← links)
• A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
• Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) (← links)
• Replicated Computations Results (RCR) Report for “MNO--PQRS: Max Nonnegativity Ordering—Piecewise-Quadratic Rate Smoothing” (Q6173266) (← links)
• Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints (Q6614711) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)