Pages that link to "Item:Q128676"
From MaRDI portal
The following pages link to Smooth minimization of non-smooth functions (Q128676):
Displaying 50 items.
- Generalized Conditional Gradient for Sparse Estimation (Q4637076) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions (Q4646444) (← links)
- Accelerated Residual Methods for the Iterative Solution of Systems of Equations (Q4685335) (← links)
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)
- TWO CURVELETS VARIATIONAL MODELS DEPEND ON DECOMPOSITION SPACES (Q4917276) (← links)
- FACTORISABLE MULTITASK QUANTILE REGRESSION (Q4959134) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
- (Q4969074) (← links)
- Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming (Q4976160) (← links)
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856) (← links)
- On split equality minimization and fixed point problems (Q4985294) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- Sparse additive machine with ramp loss (Q4995049) (← links)
- Sparse Convex Regression (Q4995070) (← links)
- Efficient and Convergent Preconditioned ADMM for the Potts Models (Q4997355) (← links)
- (Q4998940) (← links)
- (Q4999082) (← links)
- Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support (Q5003210) (← links)
- Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure (Q5013580) (← links)
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning (Q5014628) (← links)
- On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
- (Q5020878) (← links)
- Projection-free accelerated method for convex optimization (Q5038178) (← links)
- Solving a continuous multifacility location problem by DC algorithms (Q5038184) (← links)
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem (Q5043038) (← links)
- New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
- WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions (Q5043741) (← links)
- Approximation Schemes for Materials with Discontinuities (Q5053161) (← links)
- (Q5053267) (← links)
- Stochastic Optimization for Dynamic Pricing (Q5054161) (← links)
- Network Utility Maximization by Updating Individual Transmission Rates (Q5054167) (← links)
- (Q5054626) (← links)
- A tight smooth approximation of the maximum function and its applications (Q5055095) (← links)
- Particle dual averaging: optimization of mean field neural network with global convergence rate analysis* (Q5055425) (← links)
- Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods (Q5058404) (← links)
- High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q5060495) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications (Q5060788) (← links)
- Identifying Heterogeneous Effect Using Latent Supervised Clustering With Adaptive Fusion (Q5066414) (← links)
- Accelerated Optimization in the PDE Framework: Formulations for the Manifold of Diffeomorphisms (Q5068854) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
- A unified class of penalties with the capability of producing a differentiable alternative to <i>l</i><sub>1</sub> norm penalty (Q5077917) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
