Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
From MaRDI portal
Recommendations
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- Linearly constrained non-Lipschitz optimization for image restoration
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Cited in
(37)- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- Smoothing iterative consensus-based optimization algorithm for nonsmooth nonconvex optimization problems with global optimality
- Convergence analyses on sparse feedforward neural networks via group lasso regularization
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Linearly constrained non-Lipschitz optimization for image restoration
- Replicated Computations Results (RCR) Report for “MNO--PQRS: Max Nonnegativity Ordering—Piecewise-Quadratic Rate Smoothing”
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
- Smoothing quadratic regularization method for hemivariational inequalities
- Penalty methods with stochastic approximation for stochastic nonlinear programming
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
- An improved algorithm for the \(L_2-L_p\) minimization problem
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- On sparse beamformer design with reverberation
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Hessian barrier algorithms for non-convex conic optimization
- A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities
- A general non-Lipschitz infimal convolution regularized model: Lower bound theory and algorithm
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Faster p-norm minimizing flows, via smoothed q-norm problems
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
This page was built for publication: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866204)
