Smooth minimization of non-smooth functions
From MaRDI portal
Publication:128676
DOI10.1007/s10107-004-0552-5zbMath1079.90102OpenAlexW2167732364MaRDI QIDQ128676
Yu. Nesterov, Niranjan Chakravarthy
Publication date: 29 December 2004
Published in: Mathematical Programming, Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0552-5
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonsmooth analysis (49J52)
Related Items
The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems, An adaptive accelerated first-order method for convex optimization, Best subset selection via a modern optimization lens, Inertial Douglas-Rachford splitting for monotone inclusion problems, A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints, Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems, OSGA: a fast subgradient algorithm with optimal complexity, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Optimized first-order methods for smooth convex minimization, A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Gradient sliding for composite optimization, On the ergodic convergence rates of a first-order primal-dual algorithm, On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients, New results on subgradient methods for strongly convex optimization problems with a unified analysis, Algorithms and software for total variation image reconstruction via first-order methods, Fast convex optimization via inertial dynamics with Hessian driven damping, Color image processing by vectorial total variation with gradient channels coupling, Efficient numerical methods for entropy-linear programming problems, An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, Large-scale semidefinite programming via a saddle point mirror-prox algorithm, Gradient methods for minimizing composite functions, Computing equilibria in economies with incomplete markets, collateral and default penalties, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, The geometry of least squares in the 21st century, Solving optimal stopping problems via empirical dual optimization, Sparse non Gaussian component analysis by semidefinite programming, Clustering and feature selection using sparse principal component analysis, Fast alternating linearization methods for minimizing the sum of two convex functions, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Multiscale texture extraction with hierarchical \((BV,G_{p},L^2)\) decomposition, Accelerated training of max-margin Markov networks with kernels, Domain adaptation and sample bias correction theory and algorithm for regression, Dualization of signal recovery problems, First-order methods of smooth convex optimization with inexact oracle, Subgradient methods for huge-scale optimization problems, Fast first-order methods for composite convex optimization with backtracking, A class of distributed optimization methods with event-triggered communication, An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection, Model-based multiple rigid object detection and registration in unstructured range data, Operator splittings, Bregman methods and frame shrinkage in image processing, Sparse occlusion detection with optical flow, Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming, A majorization-minimization approach to the sparse generalized eigenvalue problem, Convex approximations to sparse PCA via Lagrangian duality, Testing the nullspace property using semidefinite programming, Barrier subgradient method, First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games, An optimal method for stochastic composite optimization, An implementable proximal point algorithmic framework for nuclear norm minimization, Implementation of an optimal first-order method for strongly convex total variation regularization, Smoothing proximal gradient method for general structured sparse regression, Interior point methods 25 years later, A block coordinate gradient descent method for regularized convex separable optimization and covariance selection, Random algorithms for convex minimization problems, Robust least square semidefinite programming with applications, Proximal methods for the latent group lasso penalty, A sparsity preserving stochastic gradient methods for sparse regression, Alternating direction method of multipliers for sparse principal component analysis, An infeasible-point subgradient method using adaptive approximate projections, Method of conjugate subgradients with constrained memory, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, An alternating extragradient method with non Euclidean projections for saddle point problems, Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression, Approximation bounds for sparse principal component analysis, Dual subgradient algorithms for large-scale nonsmooth learning problems, A nearly linear-time PTAS for explicit fractional packing and covering linear programs, Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement, Gradient consistency for integral-convolution smoothing functions, Universal gradient methods for convex optimization problems, On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm, An exact cooperative method for the uncapacitated facility location problem, Simultaneous nonlinear model predictive control and state estimation, On the convergence analysis of the optimized gradient method, An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods, Dynamic smoothness parameter for fast gradient methods, Minimizing finite sums with the stochastic average gradient, Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset, Adaptive smoothing algorithms for nonsmooth composite convex minimization, An extragradient-based alternating direction method for convex minimization, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem, Compressive wave computation, Optimization problems in statistical learning: duality and optimality conditions, Self-concordant barriers for convex approximations of structured convex sets, A convergent overlapping domain decomposition method for total variation minimization, Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis, Smoothing methods for nonsmooth, nonconvex minimization, Primal-dual subgradient methods for convex problems, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank, Fast proximity-gradient algorithms for structured convex optimization problems, Matrix-free interior point method for compressed sensing problems, Synthesis of cutting and separating planes in a nonsmooth optimization method, Application of a new accelerated algorithm to regression problems, A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics, An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints, Half-linear regularization for nonconvex image restoration models, A note on the complexity of proximal iterative hard thresholding algorithm, Accelerated gradient methods for nonconvex nonlinear and stochastic programming, A joint convex penalty for inverse covariance matrix estimation, Linearized alternating direction method of multipliers for sparse group and fused Lasso models, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, Sparse estimation of high-dimensional correlation matrices, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, Dual extrapolation and its applications to solving variational inequalities and related problems, Finding Dantzig selectors with a proximity operator based fixed-point algorithm, A new fast algorithm for constrained four-directional total variation image denoising problem, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Smoothing technique and its applications in semidefinite optimization, Accelerated schemes for a class of variational inequalities, An inertial forward-backward algorithm for monotone inclusions, iPiasco: inertial proximal algorithm for strongly convex optimization, A first-order primal-dual algorithm for convex problems with applications to imaging, A fast fixed point algorithm for total variation deblurring and segmentation, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, A proximal alternating linearization method for minimizing the sum of two convex functions, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Conjugate gradient type methods for the nondifferentiable convex minimization, Metric selection in fast dual forward-backward splitting, AAR-based decomposition algorithm for non-linear convex optimisation, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Bregmanized domain decomposition for image restoration, Accelerated linearized Bregman method, Construction, management, and performance of sparse Markowitz portfolios, Analysis of a new variational model to restore point-like and curve-like singularities in imaging, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, A cyclic projected gradient method, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, Regularized non-local total variation and application in image restoration, Acceleration of the PDHGM on partially strongly convex functions, Iteration-complexity of first-order penalty methods for convex programming, Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming, Parallel multi-block ADMM with \(o(1/k)\) convergence, Estimating networks with jumps, Accelerated first-order methods for hyperbolic programming, Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing, How to select a solution in generalized Nash equilibrium problems, Compensated convexity and its applications, Level-set methods for convex optimization, Efficient histogram dictionary learning for text/image modeling and classification, Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates, Universal method for stochastic composite optimization problems, A mixture of nuclear norm and matrix factorization for tensor completion, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\), On the proximal gradient algorithm with alternated inertia, Functional response regression analysis, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique, Templates for convex cone problems with applications to sparse signal recovery, An entropy regularization technique for minimizing a sum of Tchebycheff norms, Neural network based on systematically generated smoothing functions for absolute value equation, On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems, Solving nearly-separable quadratic optimization problems as nonsmooth equations, Automated parameter selection for total variation minimization in image restoration, Point process estimation with Mirror Prox algorithms, Dynamic stochastic approximation for multi-stage stochastic optimization, Tetrolet shrinkage with anisotropic total variation minimization for image approximation, Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization, The distance between convex sets with Minkowski sum structure: application to collision detection, Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions, Acceleration of primal-dual methods by preconditioning and simple subproblem procedures, An optimal randomized incremental gradient method, On max-\(k\)-sums, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, A dual reformulation and solution framework for regularized convex clustering problems, Some first-order algorithms for total variation based image restoration, Removing multiplicative noise by Douglas-Rachford splitting methods, Mathematical modeling of textures: application to color image decomposition with a projected gradient algorithm, Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach, A phase model using the Huber norm for estimating point spread function under frozen flow hypothesis, Randomized smoothing variance reduction method for large-scale non-smooth convex optimization, An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing, An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation, Flexible low-rank statistical modeling with missing data and side information, Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems, Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences, Accelerated Bregman proximal gradient methods for relatively smooth convex optimization, A Laplacian approach to \(\ell_1\)-norm minimization, A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems, An algebraic characterization of the optimum of regularized kernel methods, Sparse group fused Lasso for model segmentation: a hybrid approach, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, A fast and efficient smoothing approach to Lasso regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD), An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization, Superquantiles at work: machine learning applications and efficient subgradient computation, Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels, Discrete conditional-expectation-based simulation optimization: methodology and applications, Parallel subgradient algorithm with block dual decomposition for large-scale optimization, Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\), Finding extremals of Lagrangian actions, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems, Network manipulation algorithm based on inexact alternating minimization, On stochastic accelerated gradient with convergence rate, smoothedLasso, A reduced proximal-point homotopy method for large-scale non-convex BQP, On the computational efficiency of catalyst accelerated coordinate descent, Structured Variable Selection for Regularized Generalized Canonical Correlation Analysis, Projection-free accelerated method for convex optimization, Solving a continuous multifacility location problem by DC algorithms, Generalized maximum entropy estimation, The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem, New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Approximation Schemes for Materials with Discontinuities, Stochastic Optimization for Dynamic Pricing, Network Utility Maximization by Updating Individual Transmission Rates, Particle dual averaging: optimization of mean field neural network with global convergence rate analysis*, Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods, High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Identifying Heterogeneous Effect Using Latent Supervised Clustering With Adaptive Fusion, Accelerated Optimization in the PDE Framework: Formulations for the Manifold of Diffeomorphisms, Finding Sparse Solutions for Packing and Covering Semidefinite Programs, A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization, Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method, A unified class of penalties with the capability of producing a differentiable alternative to l1 norm penalty, Unnamed Item, An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems, Composite optimization for the resource allocation problem, Primal–dual accelerated gradient methods with small-dimensional relaxation oracle, Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations, An Iterative Reduction FISTA Algorithm for Large-Scale LASSO, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise, Unnamed Item, Unnamed Item, Rescaling Algorithms for Linear Conic Feasibility, Relax-and-split method for nonconvex inverse problems, Optimal Affine-Invariant Smooth Minimization Algorithms, Unnamed Item, Bandits with Global Convex Constraints and Objective, Online First-Order Framework for Robust Convex Optimization, Smoothing techniques and difference of convex functions algorithms for image reconstructions, Gradient projection methods for the $n$-coupling problem, A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization **, Fair Packing and Covering on a Relative Scale, Accelerated Optimization in the PDE Framework Formulations for the Active Contour Case, An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems, Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems, Unnamed Item, Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints, Unnamed Item, Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems, Unnamed Item, An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems, The chain rule for VU-decompositions of nonsmooth functions, Unnamed Item, Unnamed Item, Finite element approximation of source term identification with TV-regularization, FACTORISABLE MULTITASK QUANTILE REGRESSION, Nesterov perturbations and projection methods applied to IMRT, Rounding of convex sets and efficient gradient methods for linear programming problems, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, Sharpness, Restart, and Acceleration, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, ADMM for multiaffine constrained optimization, Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Rank Optimality for the Burer--Monteiro Factorization, Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates, On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming, Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming, l1-Penalised Ordinal Polytomous Regression Estimators with Application to Gene Expression Studies, On the acceleration of the double smoothing technique for unconstrained convex optimization problems, A Computational Framework for Multivariate Convex Regression and Its Variants, Polar Convolution, An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration, Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives, On split equality minimization and fixed point problems, Sparse additive machine with ramp loss, Sparse Convex Regression, Solving variational inequalities with Stochastic Mirror-Prox algorithm, Efficient and Convergent Preconditioned ADMM for the Potts Models, Unnamed Item, Unnamed Item, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, Unnamed Item, Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support, An Accelerated Linearized Alternating Direction Method of Multipliers, Image Restoration with Mixed or Unknown Noises, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms, Fused Multiple Graphical Lasso, Unnamed Item, Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure, Portfolio Selection with Multiple Spectral Risk Constraints, Bilevel Optimization of Regularization Hyperparameters in Machine Learning, On the Effectiveness of Richardson Extrapolation in Data Science, Solving Basis Pursuit, Monte Carlo Methods for Value-at-Risk and Conditional Value-at-Risk, Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization, Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries, Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems, Unifying mirror descent and dual averaging, A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent, It's All Relative: Regression Analysis with Compositional Predictors, Global Optimization via Schrödinger–Föllmer Diffusion, An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization, Robust enhanced indexation optimization with sparse industry Layout constraint, Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods, A Joint Fairness Model with Applications to Risk Predictions for Underrepresented Populations, Unnamed Item, Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions, A fast diagonal distance metric learning approach for large-scale datasets, Doubly iteratively reweighted algorithm for constrained compressed sensing models, A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems, Sparse quantile regression, Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing, The landscape of the proximal point method for nonconvex-nonconcave minimax optimization, Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization, Accelerated variance-reduced methods for saddle-point problems, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, Optimal Methods for Convex Risk-Averse Distributed Optimization, Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization, A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities, Radial duality. II: Applications and algorithms, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Robust Accelerated Primal-Dual Methods for Computing Saddle Points, A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management, A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM, Stochastic incremental mirror descent algorithms with Nesterov smoothing, Semiconductor superlattice physical unclonable function based two-dimensional compressive sensing cryptosystem and its application to image encryption, Efficiency of higher-order algorithms for minimizing composite functions, Smooth monotone stochastic variational inequalities and saddle point problems: a survey, Convergence rate analysis of the multiplicative gradient method for PET-type problems, Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm, A generalized Frank-Wolfe method with ``dual averaging for strongly convex composite optimization, A reduced half thresholding algorithm, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Consistent approximations in composite optimization, Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient, Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness, Compression and data similarity: combination of two techniques for communication-efficient solving of distributed variational inequalities, Explainable bilevel optimization: an application to the Helsinki Deblur Challenge, First-order methods for convex optimization, The forward-backward envelope for sampling with the overdamped Langevin algorithm, PCA Sparsified, From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems, An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems, Lagrangian and Hamiltonian dynamics for probabilities on the statistical bundle, Gradient complexity and non-stationary views of differentially private empirical risk minimization, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, Gradient regularization of Newton method with Bregman distances, Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, An introduction to continuous optimization for imaging, An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization, An acceleration procedure for optimal first-order methods, Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization, New analysis and results for the Frank-Wolfe method, Iteration-complexity of first-order augmented Lagrangian methods for convex programming, Essentials of numerical nonsmooth optimization, Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control, ``Efficient” Subgradient Methods for General Convex Optimization, The method of codifferential descent for convex and global piecewise affine optimization, A dual approach for optimal algorithms in distributed optimization over networks, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, Essentials of numerical nonsmooth optimization, Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization, Penalty and Augmented Lagrangian Methods for Constrained DC Programming, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs, Proximal Splitting Methods in Signal Processing, An optimal trade-off model for portfolio selection with sensitivity of parameters, The Moreau envelope based efficient first-order methods for sparse recovery, Accelerated, Parallel, and Proximal Coordinate Descent, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, Unnamed Item, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, Fast First-Order Algorithms for Packing–Covering Semidefinite Programs, Recursive SURE for iterative reweighted least square algorithms, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, An efficient augmented Lagrangian method with applications to total variation minimization, Gradient methods and conic least-squares problems, Structured Sparsity: Discrete and Convex Approaches, Generalized System Identification with Stable Spline Kernels, GMRES-Accelerated ADMM for Quadratic Objectives, An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, A Level-Set Method for Convex Optimization with a Feasible Solution Path, A smoothing stochastic gradient method for composite optimization, Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks, From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming, Generalizing the Optimized Gradient Method for Smooth Convex Minimization, Numerical methods for the resource allocation problem in a computer network, Robust Manhattan non-negative matrix factorization for image recovery and representation, Benchmarking large-scale distributed convex quadratic programming algorithms, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, First-order frameworks for continuous Newton-like dynamics governed by maximally monotone operators, Fast gradient methods for uniformly convex and weakly smooth problems, Nonsmooth rank-one matrix factorization landscape, Convergence Rate Analysis of Primal-Dual Splitting Schemes, Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, Perturbed Fenchel duality and first-order methods, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA), Relatively Smooth Convex Optimization by First-Order Methods, and Applications, Accelerated Uzawa methods for convex optimization, A simple nearly optimal restart scheme for speeding up first-order methods, Proximal Methods for Stationary Mean Field Games with Local Couplings, On FISTA with a relative error rule, An abstract convergence framework with application to inertial inexact forward-backward methods, A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem, Fast convergence of inertial gradient dynamics with multiscale aspects, Nonconvex model for mixing noise with fractional-order regularization, NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems, On the \(O(1/t)\) convergence rate of the LQP prediction-correction method, Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data, Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming, A generic online acceleration scheme for optimization algorithms via relaxation and inertia, Efficient algorithms for robust and stable principal component pursuit problems, A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods, The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods, Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm, String-averaging incremental stochastic subgradient algorithms, A Randomized Coordinate Descent Method with Volume Sampling, Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, TWO CURVELETS VARIATIONAL MODELS DEPEND ON DECOMPOSITION SPACES, Unnamed Item, Unnamed Item, Total Variation in Imaging, Accelerated Residual Methods for the Iterative Solution of Systems of Equations, Fast inexact decomposition algorithms for large-scale separable convex optimization, Super-Resolution of Positive Sources: The Discrete Setup, Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC, Low Complexity Regularization of Linear Inverse Problems, Exact histogram specification for digital images using a variational approach, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, Projection Methods in Conic Optimization, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Non-overlapping domain decomposition methods for dual total variation based image denoising, Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011, Near-optimal no-regret algorithms for zero-sum games, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, Iteration complexity analysis of dual first-order methods for conic convex programming, Conditional Gradient Sliding for Convex Optimization, The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$, A PROJECTION APPROACH TO THE NUMERICAL ANALYSIS OF LIMIT LOAD PROBLEMS, Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration, On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints, A family of subgradient-based methods for convex optimization problems in a unifying framework, Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach, Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent, SPARSE TEMPLATE-BASED VARIATIONAL IMAGE SEGMENTATION, A Subgradient Method for Free Material Design, Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization, Generalized Conditional Gradient for Sparse Estimation, A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization, Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent, Convex risk measures for portfolio optimization and concepts of flexibility, Unnamed Item, Domain Decomposition with Nesterov’s Method, COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis, Primal–dual first-order methods for a class of cone programming, Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization, A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm, Sparse solutions to an underdetermined system of linear equations via penalized Huber loss, Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, Oracle complexity separation in convex optimization, Convergence of inexact quasisubgradient methods with extrapolation, Accelerated gradient sliding for structured convex optimization, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration, An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems, Soft clustering by convex electoral model, Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems, A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems, Certification aspects of the fast gradient method for solving the dual of parametric convex programs, Fast gradient descent method for mean-CVaR optimization, Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization, Finding geodesics joining given points, Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model, A hybrid quasi-Newton method with application in sparse recovery, Minimizing differences of convex functions with applications to facility location and clustering, LAVIR -- locally adaptive variational image registration, Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem, Accelerated Bregman operator splitting with backtracking, Combining fast inertial dynamics for convex optimization with Tikhonov regularization, An optimal subgradient algorithm for large-scale bound-constrained convex optimization, An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking, An accelerated proximal augmented Lagrangian method and its application in compressive sensing, Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity, Mathematical programming formulations for piecewise polynomial functions, Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Selective bi-coordinate method for limit non-smooth resource allocation type problems, Joint ranking SVM and binary relevance with robust low-rank learning for multi-label classification, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, PAL-Hom method for QP and an application to LP, A simple convergence analysis of Bregman proximal gradient algorithm, Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization, Social welfare and profit maximization from revealed preferences, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step, Efficient, certifiably optimal clustering with applications to latent variable graphical models, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Accelerated gradient boosting, A relaxed Newton-Picard like method for Huber variant of total variation based image restoration, Randomized first order algorithms with applications to \(\ell _{1}\)-minimization, Variable smoothing for convex optimization problems using stochastic gradients, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, An adaptive primal-dual framework for nonsmooth convex minimization, Numerical computations of split Bregman method for fourth order total variation flow, Implementable tensor methods in unconstrained convex optimization, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization, Approximating the total variation with finite differences or finite elements, Accelerated gradient sliding for minimizing a sum of functions, Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing, Asynchronous Lagrangian scenario decomposition, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Homogeneous penalizers and constraints in convex image restoration, Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization, Regret bounded by gradual variation for online convex optimization, A minmax regret linear regression model under uncertainty in the dependent variable, Weiszfeld's method: old and new results, Convergence of the surrogate Lagrangian relaxation method, A numerical exploration of compressed sampling recovery, Alternating direction method for covariance selection models, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets, On the properties of the method of minimization for convex functions with relaxation on the distance to extremum, Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks, Faster algorithms for extensive-form game solving via improved smoothing functions, Primal-dual splitting method for high-order model with application to image restoration, Robust Schatten-\(p\) norm based approach for tensor completion, An accelerated version of alternating direction method of multipliers for TV minimization in EIT, On sparse beamformer design with reverberation, Accelerated proximal incremental algorithm schemes for non-strongly convex functions, Solving \(k\)-center problems involving sets based on optimization techniques, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems, Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity, Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems, Universal method of searching for equilibria and stochastic equilibria in transportation networks, Optimal subgradient methods: computational properties for large-scale linear inverse problems, Exploiting problem structure in optimization under uncertainty via online convex optimization, Accelerated augmented Lagrangian method for total variation minimization, Generalized self-concordant functions: a recipe for Newton-type methods, Efficiency of minimizing compositions of convex functions and smooth maps, A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions, Generalized affine scaling algorithms for linear programming problems, An efficient primal dual prox method for non-smooth optimization, Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems, A characterization theorem and an algorithm for a convex hull problem, A variable smoothing algorithm for solving convex optimization problems, Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing, An algorithm for total variation regularized photoacoustic imaging, Mirror Prox algorithm for multi-term composite minimization and semi-separable problems, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, On efficient randomized algorithms for finding the PageRank vector, On the efficiency of a randomized mirror descent algorithm in online optimization problems
Cites Work
