Pages that link to "Item:Q4679946"
From MaRDI portal
The following pages link to Sequential greedy approximation for certain convex optimization problems (Q4679946):
Displaying 32 items.
- Convex optimization on Banach spaces (Q285434) (← links)
- Convergence and rate of convergence of some greedy algorithms in convex optimization (Q338510) (← links)
- A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization (Q411092) (← links)
- Greedy expansions in convex optimization (Q483395) (← links)
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
- Dictionary descent in optimization (Q519963) (← links)
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- Analysis of error propagation in particle filters with approximation (Q657703) (← links)
- Non intrusive reduced order modeling of parametrized PDEs by kernel POD and neural networks (Q825483) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- Nonlinear tensor product approximation of functions (Q890230) (← links)
- Sequential characterization of solutions in convex composite programming and applications to vector optimization (Q1008785) (← links)
- An algorithmic separating hyperplane theorem and its applications (Q1728094) (← links)
- On the convergence rate of kernel-based sequential greedy regression (Q1938256) (← links)
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594) (← links)
- Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
- Randomized mixture models for probability density approximation and estimation (Q2200581) (← links)
- Boosting as a kernel-based method (Q2331677) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- Greedy strategies for convex optimization (Q2363679) (← links)
- Density estimation with stagewise optimization of the empirical risk (Q2384149) (← links)
- Rescaled pure greedy algorithm for convex optimization (Q2424223) (← links)
- Boosting with early stopping: convergence and consistency (Q2583412) (← links)
- Greedy training algorithms for neural networks and applications to PDEs (Q2699382) (← links)
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods (Q2830569) (← links)
- Convergence of a greedy algorithm for high-dimensional convex nonlinear problems (Q2892231) (← links)
- Large-Margin Classification in Infinite Neural Networks (Q3057218) (← links)
- Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data (Q3556804) (← links)
- Sparse Approximation by Greedy Algorithms (Q4609500) (← links)
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications (Q5060788) (← links)
- PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
