Nonsmooth projection-free optimization with functional constraints

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Stochastic programming (90C15) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Reduced rank regression via adaptive nuclear norm penalization
Smooth minimization of non-smooth functions
Solving variational inequalities with monotone operators on domains given by linear minimization oracles
Lectures on convex optimization
A bundle-filter method for nonsmooth convex constrained optimization
Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
Complexity bounds for primal-dual methods minimizing the model of objective function
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Support-vector networks
New variants of bundle methods
Complexity of linear minimization and projection on some sets
Efficient projection algorithms onto the weighted \(\ell_1\) ball
Algorithms for stochastic optimization with function or expectation constraints
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
First-order and stochastic optimization methods for machine learning
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
Stochastic first-order methods for convex and nonconvex functional constrained optimization
Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
Stochastic Network Optimization with Application to Communication and Queueing Systems
Randomized Smoothing for Stochastic Optimization
Minimum-cost flow algorithms: an experimental evaluation
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Rate control for communication networks: shadow prices, proportional fairness and stability
Robust Stochastic Approximation Approach to Stochastic Programming
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
An algorithm for nonlinear multicommodity flow problems
The smallest convex extensions of a convex function
A Level-Set Method for Convex Optimization with a Feasible Solution Path
First-Order Methods in Optimization
Convex Optimization in Signal Processing and Communications
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
Extension of Convex Function
The method of penalty estimates for conditional extremum problems
The flow deviation method: An approach to store‐and‐forward communication network design
Sparse Approximate Solutions to Semidefinite Programs
Proximité et dualité dans un espace hilbertien
Estimating Linear Restrictions on Regression Coefficients for Multivariate Normal Distributions
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems
Iteration-complexity of first-order augmented Lagrangian methods for convex programming

This page was built for publication: Nonsmooth projection-free optimization with functional constraints