Pattern search method for discrete \(L_{1}\)-approximation

DOI10.1007/s10957-007-9204-2zbMath1129.49043OpenAlexW2030699736MaRDI QIDQ2454735

C. Bogani, Alessandra Papini, Maria Grazia Gasparo

Publication date: 16 October 2007

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-007-9204-2

zbMATH Keywords

nonsmooth optimizationconvex optimizationpattern search methods

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Applications of optimal control and differential games (49N90) Pattern recognition, speech recognition (68T10)

Related Items (1)

Generalized pattern search methods for a class of nonsmooth optimization problems with structure

Uses Software

• Optimization Toolbox

Cites Work

• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• Generalized pattern searches with derivative information
• An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
• Convergence results for generalized pattern search algorithms are tight
• On the Convergence of Pattern Search Algorithms
• Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Optimization and nonsmooth analysis
• The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
• On the Convergence of the Multidirectional Search Algorithm
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• Analysis of Generalized Pattern Searches
• Pattern Search Methods for Linearly Constrained Minimization
• Pattern Search Algorithms for Bound Constrained Minimization
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Unnamed Item

This page was built for publication: Pattern search method for discrete \(L_{1}\)-approximation