Sequential greedy approximation for certain convex optimization problems
From MaRDI portal
Recommendations
- On sequential optimality theorems for convex optimization problems
- scientific article; zbMATH DE number 4070639
- Convergence of sequential approximation method for constrained optimization problems
- scientific article; zbMATH DE number 775098
- Greedy approximation in convex optimization
- scientific article; zbMATH DE number 5245384
- scientific article; zbMATH DE number 1161041
- scientific article; zbMATH DE number 3956307
- Sequential difference-of-convex programming
- A sequential minimization algorithm based on the convexification approach
Cited in
(41)- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- An algorithmic separating hyperplane theorem and its applications
- On the convergence rate of kernel-based sequential greedy regression
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- Biorthogonal greedy algorithms in convex optimization
- Randomized mixture models for probability density approximation and estimation
- Boosting as a kernel-based method
- A characterization theorem and an algorithm for a convex hull problem
- Greedy approximation in convex optimization
- Greedy strategies for convex optimization
- Density estimation with stagewise optimization of the empirical risk
- Rescaled pure greedy algorithm for convex optimization
- Boosting with early stopping: convergence and consistency
- Greedy training algorithms for neural networks and applications to PDEs
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Convex optimization on Banach spaces
- Convergence of a greedy algorithm for high-dimensional convex nonlinear problems
- Large-margin classification in infinite neural networks
- Convergence and rate of convergence of some greedy algorithms in convex optimization
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
- Sparse approximation by greedy algorithms
- scientific article; zbMATH DE number 1827088 (Why is no real title available?)
- Greedy expansions in convex optimization
- Analysis of a greedy reconstruction algorithm
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Dictionary descent in optimization
- Schwarz iterative methods: infinite space splittings
- A New Look At A Greedy Algorithm For Solving A Class Of Convex Programming Problems
- The greedy simplex algorithm for double sparsity constrained optimization problems
- Analysis of error propagation in particle filters with approximation
- PolyCD: optimization via cycling through the vertices of a polytope
- Brief introduction in greedy approximation
- Randomized greedy algorithms for neural network optimization in solving partial differential equations
- Bregman model averaging for forecast combination
- On greedy approximation in complex Banach spaces
- Sparse sampling recovery by greedy algorithms
- Non intrusive reduced order modeling of parametrized PDEs by kernel POD and neural networks
- Robust vertex enumeration for convex hulls in high dimensions
- Nonlinear tensor product approximation of functions
This page was built for publication: Sequential greedy approximation for certain convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679946)
