A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)

DOI10.1007/BF00938486zbMath0571.90074OpenAlexW2056385679MaRDI QIDQ1061617

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00938486

zbMATH Keywords

optimality conditions canonical simplex projection of a point projection onto a simplex successive location of the solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)

Related Items (53)

A residual algorithm for finding a fixed point of a nonexpansive mapping ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Projections onto the canonical simplex with additional linear inequalities ⋮ Fast projection onto the simplex and the \(l_1\) ball ⋮ Estimation of low rank density matrices: bounds in Schatten norms and other distances ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Geometrically convergent projection method in matrix games ⋮ Two fast algorithms for projecting a point onto the canonical simplex ⋮ Comparative study of two fast algorithms for projecting a point to the standard simplex ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ A first-order primal-dual algorithm for convex problems with applications to imaging ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Distance majorization and its applications ⋮ Non-smooth non-convex Bregman minimization: unification and new algorithms ⋮ A gradient descent method for estimating the Markov chain choice model ⋮ A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball ⋮ Lifting-based variational multiclass segmentation algorithm: design, convergence analysis, and implementation with applications in medical imaging ⋮ Screening Rules and its Complexity for Active Set Identification ⋮ PAMR: passive aggressive mean reversion strategy for portfolio selection ⋮ Augmented Lagrangian method for total variation based image restoration and segmentation over triangulated surfaces ⋮ Active Mean Fields for Probabilistic Image Segmentation: Connections with Chan--Vese and Rudin--Osher--Fatemi Models ⋮ Fast projections onto mixed-norm balls with applications ⋮ Unnamed Item ⋮ Minimization of convex functions on the convex hull of a point set ⋮ An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) ⋮ Objective Bayesian analysis for the normal compositional model ⋮ A purely geometric approach to the problem of computing the projection of a point on a simplex ⋮ A fast procedure for calculating importance weights in bootstrap sampling ⋮ Strong semismoothness of projection onto slices of second-order cone ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Distance to the stochastic part of phylogenetic varieties ⋮ A path-based double projection method for solving the asymmetric traffic network equilibrium problem ⋮ Portfolio management without probabilities or statistics ⋮ Inexact primal–dual gradient projection methods for nonlinear optimization on convex set ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints ⋮ On the continuous quadratic knapsack problem ⋮ Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model ⋮ A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model ⋮ Finding flow equilibrium with projective methods with decomposition and route generation ⋮ Single-forward-step projective splitting: exploiting cocoercivity ⋮ Midrange geometric interactions for semantic segmentation. Constraints for continuous multi-label optimization ⋮ Semisupervised data classification via the Mumford-Shah-Potts-type model ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ A projected gradient method for optimization over density matrices ⋮ Unnamed Item ⋮ A fast and efficient smoothing approach to Lasso regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD) ⋮ A Computational Framework for Multivariate Convex Regression and Its Variants ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem ⋮ On the convergence of inexact block coordinate descent methods for constrained optimization

Cites Work

This page was built for publication: A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)