Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
From MaRDI portal
Publication:5077165
DOI10.1080/02331934.2021.1958810zbMath1489.90100OpenAlexW3189067467MaRDI QIDQ5077165
Yong-Jin Liu, Lanyu Lin, Bo Wang
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1958810
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- An O(n) algorithm for quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- On the continuous quadratic knapsack problem
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Structured low rank approximation
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- A nonsmooth version of Newton's method
- Finding the projection onto the intersection of a closed half-space and a variable box
- An introduction to a class of matrix cone programming
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Some mapping theorems
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Optimization and nonsmooth analysis
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Fastest Mixing Markov Chain on a Graph
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Some Applications of the Pseudoinverse of a Matrix
- Convex Analysis
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
This page was built for publication: Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
