LSSOL
From MaRDI portal
Cited in
(20)- Minimizing pseudoconvex functions on convex compact sets
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A practical anti-cycling procedure for linearly constrained optimization
- Newton's method for linear inequality systems
- On the rate of convergence of two minimax algorithms
- Piecewise-linear pathways to the optimal solution set in linear programming
- Duality in robust linear regression using Huber's M-estimator
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- AAFAC
- LPKIT
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- scientific article; zbMATH DE number 1295101 (Why is no real title available?)
- scientific article; zbMATH DE number 686908 (Why is no real title available?)
- scientific article; zbMATH DE number 977754 (Why is no real title available?)
- A quadratic programming approach for joint image reconstruction: mathematical and geophysical examples
- A New Finite Continuation Algorithm for Linear Programming
- Computing the Moore–Penrose Inverse for the Covariance Matrix in Constrained Nonlinear Estimation
- On solving large-scale finite minimax problems using exponential smoothing
- qpSWIFT
This page was built for software: LSSOL
