Pages that link to "Item:Q3835665"
From MaRDI portal
The following pages link to An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665):
Displaying 16 items.
- Convex optimization approach to a single quadratically constrained quadratic minimization problem (Q623792) (← links)
- An approach to the solution of nonlinear unconstrained optimization problems (Q1040414) (← links)
- Deriving an unconstrained convex program for linear programming (Q1321279) (← links)
- Perturbing the dual feasible region for solving convex quadratic programs (Q1367785) (← links)
- UOBYQA: unconstrained optimization by quadratic approximation (Q1849505) (← links)
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003) (← links)
- Unconstrained convex programming approach to linear programming (Q1905944) (← links)
- On the entropic perturbation and exponential penalty methods for linear programming (Q1918012) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Continuous Approaches to the Unconstrained Binary Quadratic Problems (Q2958833) (← links)
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization (Q3087581) (← links)
- (Q4485933) (← links)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)
- Primal-dual method of solving convex quadratic programming problems (Q5943631) (← links)
- On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules (Q6655784) (← links)
