Projected gradient algorithms for optimization over order simplices

DOI10.1080/10556788.2014.911872MaRDI QIDQ2926073zbMATH OpenOpenAlexFDO

Authors Yiqing Hu, Chunlin Hao, Yuhong Dai

Publication date 29 October 2014

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2014.911872

zbMATH Keywords

constrained optimizationprimal-dual algorithmprojected gradientorder simplex

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• 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
• scientific article; zbMATH DE number 3924512
• Projections onto order simplexes
• An algorithm for projecting onto simplicial cones

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
• A General Quadratic Programming Algorithm
• A Nonmonotone Line Search Technique for Newton’s Method
• A steady state model of Couette flow with viscous heating
• Active set algorithms for isotonic regression; a unifying framework
• Alternate step gradient method*
• Analysis of monotone gradient methods
• Convex programming in Hilbert space
• Gradient Method with Retards and Generalizations
• Gradient projection methods for quadratic programs and applications in training support vector machines
• Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
• Maximum likelihood estimation for ordered expectations of correlated binary variables
• Minimizing Separable Convex Functions Subject to Simple Chain Constraints
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On the Barzilai and Borwein choice of steplength for the gradient method
• On the nonmonotone line search
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Projections onto order simplexes
• Testing Unconstrained Optimization Software
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Two-Point Step Size Gradient Methods
• R-linear convergence of the Barzilai and Borwein gradient method

This page was built for publication: Projected gradient algorithms for optimization over order simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926073)