Pages that link to "Item:Q2706324"
From MaRDI portal
The following pages link to A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems (Q2706324):
Displaying 10 items.
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- Sequential feasible optimal power flow in power systems (Q1045287) (← links)
- The revised DFP algorithm without exact line search (Q1811670) (← links)
- KLERC: kernel Lagrangian expectile regression calculator (Q1995837) (← links)
- A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems (Q2568604) (← links)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
