Pages that link to "Item:Q2817841"

The following pages link to Projection onto a polyhedron that exploits sparsity (Q2817841):

Displaying 15 items.

• An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
• Set-membership estimations for the evolution of infectious diseases in heterogeneous populations (Q527276) (← links)
• A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems (Q781111) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• Variational analysis on the signed distance functions (Q1730765) (← links)
• Optimally sparse representations of cartoon-like cylindrical data (Q2050704) (← links)
• Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
• Generalized uniformly optimal methods for nonlinear programming (Q2316202) (← links)
• Inexact alternating direction methods of multipliers for separable convex optimization (Q2419545) (← links)
• On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
• Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
• Subgradient regularized multivariate convex regression at scale (Q6573015) (← links)
• Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm (Q6601376) (← links)
• Spectrally constrained optimization (Q6608071) (← links)