Pages that link to "Item:Q2866194"

The following pages link to Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms (Q2866194):

Displaying 50 items.

• Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
• On solutions of sparsity constrained optimization (Q259112) (← links)
• The first-order necessary conditions for sparsity constrained optimization (Q259127) (← links)
• The sparse principal component analysis problem: optimality conditions and algorithms (Q306306) (← links)
• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints (Q344949) (← links)
• Total variation reconstruction from quadratic measurements (Q526711) (← links)
• Nonlinear frames and sparse reconstructions in Banach spaces (Q682869) (← links)
• A quadratic penalty method for hypergraph matching (Q683734) (← links)
• A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q827377) (← links)
• Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
• Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems (Q1670095) (← links)
• Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming (Q1682972) (← links)
• Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing (Q1792868) (← links)
• A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization (Q2007126) (← links)
• Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
• Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
• Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
• An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
• Sequential optimality conditions for cardinality-constrained optimization problems with applications (Q2044577) (← links)
• On DC based methods for phase retrieval (Q2050353) (← links)
• Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration (Q2069147) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints (Q2108537) (← links)
• On nondegenerate M-stationary points for sparsity constrained nonlinear optimization (Q2114575) (← links)
• Quaternion matrix optimization: motivation and analysis (Q2139274) (← links)
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
• Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
• Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem (Q2203360) (← links)
• A proximal gradient method for control problems with non-smooth and non-convex control cost (Q2231051) (← links)
• On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach (Q2234331) (← links)
• Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← links)
• Nonsmooth sparsity constrained optimization problems: optimality conditions (Q2311196) (← links)
• Optimality conditions for rank-constrained matrix optimization (Q2314061) (← links)
• Solving equations of random convex functions via anchored regression (Q2317380) (← links)
• Optimization problems involving group sparsity terms (Q2330642) (← links)
• Greedy approximation in convex optimization (Q2343051) (← links)
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
• Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
• A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares (Q2422134) (← links)
• Phase retrieval: stability and recovery guarantees (Q2450942) (← links)
• Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
• A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
• Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization (Q2697355) (← links)