Pages that link to "Item:Q2515043"

The following pages link to Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043):

Displaying 47 items.

• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
• A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
• An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
• Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← 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)
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← 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)
• Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← 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)
• Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
• On constrained optimization with nonconvex regularization (Q2225521) (← links)
• Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
• A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (Q2330643) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• Some theoretical limitations of second-order algorithms for smooth constrained optimization (Q2417153) (← links)
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery (Q2419553) (← links)
• $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
• An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming (Q2957850) (← links)
• Linearly Constrained Non-Lipschitz Optimization for Image Restoration (Q3454492) (← links)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
• (Q5053267) (← links)
• High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q5060495) (← links)
• A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
• Smoothing quadratic regularization method for hemivariational inequalities (Q5151500) (← links)
• Computation of second-order directional stationary points for group sparse optimization (Q5210743) (← links)
• Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection (Q5882243) (← links)
• Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints (Q6055122) (← links)
• Neural network for a class of sparse optimization with \(L_0\)-regularization (Q6077003) (← links)
• A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model (Q6111348) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
• A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization (Q6181376) (← links)