Pattern search method for discrete L₁-approximation
From MaRDI portal
Publication:2454735
Recommendations
Cites work
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- An Improved Algorithm for Discrete l₁ Linear Approximation
- Analysis of Generalized Pattern Searches
- Convergence results for generalized pattern search algorithms are tight
- Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Generalized pattern searches with derivative information
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
- On the Convergence of Pattern Search Algorithms
- On the Convergence of the Multidirectional Search Algorithm
- Optimization and nonsmooth analysis
- Pattern Search Algorithms for Bound Constrained Minimization
- Pattern Search Methods for Linearly Constrained Minimization
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
Cited in
(3)
This page was built for publication: Pattern search method for discrete \(L_{1}\)-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454735)