swMATH7785MaRDI QIDQ19802FDOQ19802
Author name not available (Why is that?)
Official website: http://www.stanford.edu/group/SOL/lssol.htm
Cited In (20)
- Title not available (Why is that?)
- On the rate of convergence of two minimax algorithms
- On solving large-scale finite minimax problems using exponential smoothing
- Piecewise-linear pathways to the optimal solution set in linear programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A quadratic programming approach for joint image reconstruction: mathematical and geophysical examples
- AAFAC
- Title not available (Why is that?)
- Computing the Moore–Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation
- LPKIT
- Title not available (Why is that?)
- A practical anti-cycling procedure for linearly constrained optimization
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Minimizing pseudoconvex functions on convex compact sets
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- Duality in robust linear regression using Huber's \(M\)-estimator
- qpSWIFT
- A New Finite Continuation Algorithm for Linear Programming
- Newton's method for linear inequality systems
This page was built for software: LSSOL
