A Level-Set Method for Convex Optimization with a Feasible Solution Path
From MaRDI portal
Publication:4562247
DOI10.1137/17M1152334zbMath1411.90268OpenAlexW2903665793WikidataQ128759846 ScholiaQ128759846MaRDI QIDQ4562247
Selvaprabu Nadarajah, Qihang Lin, Negar Soheili
Publication date: 19 December 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1152334
Related Items (8)
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs ⋮ A stochastic primal-dual method for a class of nonconvex constrained optimization ⋮ Unnamed Item ⋮ First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems ⋮ An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems ⋮ Stochastic first-order methods for convex and nonconvex functional constrained optimization ⋮ Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints ⋮ A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Gradient methods for minimizing composite functions
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- On solving large-scale finite minimax problems using exponential smoothing
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Introductory lectures on convex optimization. A basic course.
- The nonlinear knapsack problem - algorithms and applications
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Variational Properties of Value Functions
- A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems
- Smoothing and First Order Methods: A Unified Framework
- Sparse Optimization with Least-Squares Constraints
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Robust Stochastic Approximation Approach to Stochastic Programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Neyman-Pearson classification, convexity and stochastic constraints
- ``Efficient” Subgradient Methods for General Convex Optimization
- Geometric Programming for Communication Systems
This page was built for publication: A Level-Set Method for Convex Optimization with a Feasible Solution Path
