-

 

 

 




Optimization Online





 

Convex and Nonsmooth Optimization Submissions - 2018

December 2018

Convex Optimization
A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression
Luis M. Briceno-Arias, Giovanni Chierchia, Emilie Chouzenoux, Jean-Christophe Pesquet


January 2018

Convergence rates of Forward–Douglas–Rachford splitting method
Cesare Molinari, Jingwei Liang, Jalal Fadili

Nonsmooth Optimization
The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
Radu Ioan Bot, Dang-Khoa Nguyen

Convex Optimization
Convergence rates of proximal gradient methods via the convex conjugate
David Gutman, Javier Pena

Convex Optimization
A forward-backward penalty scheme with inertial effects for montone inclusions. Applications to convex bilevel programming
Radu Ioan Bot, Dang-Khoa Nguyen

Convex Optimization
Simplified Versions of the Conditional Gradient Method
Igor Konnov

Convex Optimization
Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive stepsizes and convergence
Dirk A. Lorenz, Quoc Tran-Dinh

Convex Optimization
Douglas-Rachford Splitting for Pathological Convex Optimization
Ernest K. Ryu, Yanli Liu, Wotao Yin

Proximal Alternating Penalty Algorithms for Nonsmooth Constrained Convex Optimization
Quoc Tran-Dinh

Nonsmooth Optimization
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Weiwei Kong, Jefferson Melo, Renato Monteiro

Convex Optimization
On Quasi-Newton Forward--Backward Splitting: Proximal Calculus and Convergence
Stephen Becker, Jalal Fadili, Peter Ochs

Convex Optimization
On self-concordant barriers for generalized power cones
Scott Roy, Lin Xiao

Convex Optimization
An Alternating Minimization Method for Matrix Completion Problem
Yuan Shen, Xin Liu


February 2018

The condition of a function relative to a polytope
David H. Gutman, Javier Pena

Nonsmooth Optimization
Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on weakly convex function
Damek Davis, Dmitriy Drusvyatskiy

Nonsmooth Optimization
Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation
Hugo Raguet, Landrieu Loïc

Pointed Closed Convex Sets are the Intersection of All Rational Supporting Closed Halfspaces
Marcel de Carli Silva, Levent Tunçel

Convex Optimization
Uniqueness of DRS as the 2 Operator Resolvent-Splitting and Impossibility of 3 Operator Resolvent-Splitting
Ernest K. Ryu

Convex Optimization
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First-Order Methods
James Renegar, Benjamin Grimmer


March 2018

Nonsmooth Optimization
Inexact Successive Quadratic Approximation for Regularized Optimization
Ching-pei Lee, Stephen Wright

Nonsmooth Optimization
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
Andre Milzarek, Xiantao Xiao, Shicong Cen, Zaiwen Wen, Michael Ulbrich

Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting
Patrick R. Johnstone, Jonathan Eckstein

Convex Optimization
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
Zhaosong Lu, Zirui Zhou

Stochastic model-based minimization of weakly convex functions
Damek Davis, Dmitriy Drusvyatskiy

Entropic proximal operators for nonnegative trigonometric polynomials
Hsiao-Han Chao, Lieven Vandenberghe


April 2018

Convex Optimization
BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh

Convex Optimization
User Manual for BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh

New inertial factors of a splitting method for monotone inclusions
Dong Yunda, Fang Bingbing , Wang Xiangyang

Complexity of gradient descent for multiobjective optimization
J. Fliege, A. I. F. Vaz, L. N. Vicente

Convex Optimization
Primal-Dual Interior-Point Methods for Domain-Driven Formulations: Algorithms
Mehdi Karimi, Levent Tuncel

Nonsmooth Optimization
Fast Multilevel Algorithms for Compressive Principle Component Pursuit
Vahan Hovhannisyan, Yannis Panagakis, Panos Parpas, Stefanos Zafeiriou


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society