Pages that link to "Item:Q1174457"
From MaRDI portal
The following pages link to A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457):
Displaying 13 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Partial linearization methods in nonlinear programming (Q1321373) (← links)
- A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- A successive quadratic programming method for a class of nonsmooth optimization problems and its global convergence (Q2769349) (← links)
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization (Q2910881) (← links)
- (Q3065074) (← links)
- A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING (Q3369951) (← links)
- (Q3731381) (← links)
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT (Q5288490) (← links)