On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
From MaRDI portal
Publication:1717808
DOI10.1155/2014/165701zbMath1407.65022OpenAlexW2125451192WikidataQ59063411 ScholiaQ59063411MaRDI QIDQ1717808
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/165701
Related Items (2)
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Proposal of simple and accurate two-parametric approximation for the \(Q\)-function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of an algorithm for discrete \(L_p\) approximation
- An algorithm for discrete linear \(L_ p\) approximation
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- On two methods for discrete \(L_p\) approximation
- Computational experiences with discrete L\(_p\)-approximation
- Well-posedness and primal-dual analysis of some convex separable optimization problems
- Complexity of approximation problems
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
- A Globally Convergent Method for $l_p $ Problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
- A subgradient algorithm for certain minimax and minisum problems
- A New Class of Incremental Gradient Methods for Least Squares Problems
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
This page was built for publication: On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
