Fetching the paper…
Reading the bibliography…
We consider a non-convex constrained optimization problem, where the objective function is weakly convex and the constraint function is either convex or weakly convex.
The relaxation method of solving systems of inequalities with convex functions on the left-hand side
Ivan Ivanovich Eremin · 1965
Earlier work this paper cites.
A general method of solving extremum problems
Boris T. Polyak · 1967
Earlier work this paper cites.
Minimization of unsmooth functionals
Boris T. Polyak · 1969
Earlier work this paper cites.
An ℓ 1 \ell_{1} penalty method for nonlinear constraints
Roger Fletcher · 1985
Earlier work this paper cites.
On the exactness of a class of nondifferentiable penalty functions
Gianni Di Pillo and Luigi Grippo · 1988
Earlier work this paper cites.
A sequential quadratic programming method for potentially infeasible mathematical programs
James V. Burke · 1989
Earlier work this paper cites.
Exact penalty functions in constrained optimization
Gianni Di Pillo and Luigi Grippo · 1989
Earlier work this paper cites.
Scaling up the accuracy of naive-bayes classifiers: A decision-tree hybrid
Ron Kohavi et al · 1996
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
Jianqing Fan and Runze Li · 2001
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
Coralia Cartis, Nicholas I.M. Gould, and Philippe L. Toint · 2011
Earlier work this paper cites.
Neyman-pearson classification, convexity and stochastic constraints
Philippe Rigollet and Xin Tong · 2011
Earlier work this paper cites.
Validation analysis of mirror descent stochastic approximation method
Guanghui Lan, Arkadi Nemirovski, and Alexander Shapiro · 2012
Earlier work this paper cites.
An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
Alfred Auslender · 2013
Earlier work this paper cites.
A data-driven approach to predict the success of bank telemarketing
Sérgio Moro, Paulo Cortez, and Paulo Rita · 2014
Earlier work this paper cites.
Machine bias
Julia Angwin, Jeff Larson, Surya Mattu, and Lauren Kirchner · 2016
Earlier work this paper cites.
Majorization-minimization procedures and convergence of sqp methods for semi-algebraic and tame programs
Jérôme Bolte and Edouard Pauwels · 2016
Earlier work this paper cites.
Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
Mingyi Hong, Zhi-Quan Luo, and Meisam Razaviyayn · 2016
Earlier work this paper cites.
A reductions approach to fair classification
Alekh Agarwal, Alina Beygelzimer, Miroslav Dudík, John Langford, and Hanna Wallach · 2018
Earlier work this paper cites.
Mirror descent and convex optimization problems with non-smooth inequality constraints
Anastasia Bayandina, Pavel Dvurechensky, Alexander Gasnikov, Fedor Stonyakin, and Alexander Titov · 2018
Earlier work this paper cites.
Complexity of finding near-stationary points of convex functions stochastically
Damek Davis and Dmitriy Drusvyatskiy · 2018
Earlier work this paper cites.
Damek Davis and Dmitriy Drusvyatskiy · 2018
Earlier work this paper cites.
Subgradient methods for sharp weakly convex functions
Damek Davis, Dmitriy Drusvyatskiy, Kellie J. MacPhee, and Courtney Paquette · 2018
Earlier work this paper cites.
Lectures on convex optimization
Yurii Nesterov · 2018
Earlier work this paper cites.
Fedor S. Stonyakin and Alexander A. Titov · 2018
Earlier work this paper cites.
RSG: Beating subgradient method without smoothness and strong convexity
Tianbao Yang and Qihang Lin · 2018
Earlier work this paper cites.
On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization
Siqi Zhang and Niao He · 2018
Earlier work this paper cites.
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
Coralia Cartis, Nicholas I.M. Gould, and Philippe L. Toint · 2019
Earlier work this paper cites.
Stochastic model-based minimization of weakly convex functions
Damek Davis and Dmitriy Drusvyatskiy · 2019
Cited alongside, same era.
Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
Damek Davis and Benjamin Grimmer · 2019
Cited alongside, same era.
Efficiency of minimizing compositions of convex functions and smooth maps
Dmitriy Drusvyatskiy and Courtney Paquette · 2019
Cited alongside, same era.
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
Weiwei Kong, Jefferson G. Melo, and Renato D.C. Monteiro · 2019
Cited alongside, same era.
An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints
Mehmet Fatih Sahin, Ahmet Alacaoglu, Fabian Latorre, Volkan Cevher, et al · 2019
Cited alongside, same era.
Frank E. Curtis, Daniel P. Robinson, and Baoyu Zhou · 2021
Later among the works it cites.
Minibatch and momentum model-based methods for stochastic weakly convex optimization
Qi Deng and Wenzhi Gao · 2021
Later among the works it cites.
Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and iteration complexity
Francisco Facchinei, Vyacheslav Kungurtsev, Lorenzo Lampariello, and Gesualdo Scutari · 2021
Later among the works it cites.
Oracle complexity in nonsmooth nonconvex optimization
Guy Kornowski and Ohad Shamir · 2021
Later among the works it cites.
Rate-improved inexact augmented lagrangian method for constrained nonconvex optimization
Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu, and Yangyang Xu · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
Fedor S. Stonyakin, Mohammad S. Alkousa, Alexey N. Stepanov, and Aleksandr A. Titov · 2019
Cited alongside, same era.
On some methods for strongly convex optimization problems with one functional constraint
Fedor S. Stonyakin, Mohammad S. Alkousa, Alexander A. Titov, and Victoria V. Piskunova · 2019
Cited alongside, same era.
Mirror descent for constrained optimization problems with large subgradient values
Fedor S. Stonyakin, Alexey N. Stepanov, Alexander A. Titov, and Alexander V. Gasnikov · 2019
Cited alongside, same era.
Mirror descent and constrained online optimization problems
Alexander A. Titov, Fedor S. Stonyakin, Alexander V. Gasnikov, and Mohammad S. Alkousa · 2019
Cited alongside, same era.
Global convergence of admm in nonconvex nonsmooth optimization
Yu Wang, Wotao Yin, and Jinshan Zeng · 2019
Cited alongside, same era.
Fairness constraints: A flexible approach for fair classification
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi · 2019
Cited alongside, same era.
On modification of an adaptive stochastic mirror descent algorithm for convex optimization problems with functional constraints
Mohammad S. Alkousa · 2020
Cited alongside, same era.
Augmented lagrangian–based first-order methods for convex-constrained programs with weakly convex objective
Zichong Li and Yangyang Xu · 2021
Later among the works it cites.
Learning fair scoring functions: Bipartite ranking under roc-based fairness constraints
Robin Vogel, Aurélien Bellet, and Stéphan Clémençon · 2021
Later among the works it cites.
Level constrained first order methods for function constrained optimization
Digvijay Boob, Qi Deng, and Guanghui Lan · 2022
Later among the works it cites.
Functional constrained optimization for risk aversion and sparsity control
Yi Cheng, Guanghui Lan, and H. Edwin Romeijn · 2022
Later among the works it cites.
Zhichao Jia and Benjamin Grimmer · 2022
Later among the works it cites.
A stochastic primal-dual method for a class of nonconvex constrained optimization
Lingzi Jin and Xiao Wang · 2022
Later among the works it cites.
On the complexity of finding small subgradients in nonsmooth optimization
Guy Kornowski and Ohad Shamir · 2022
Later among the works it cites.
Zeroth-order optimization for composite problems with functional constraints
Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu, and Yangyang Xu · 2022
Later among the works it cites.
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
Qihang Lin, Runchao Ma, and Yangyang Xu · 2022
Later among the works it cites.
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2022
Later among the works it cites.
On the finite-time complexity and practical computation of approximate stationarity concepts of lipschitz functions
Lai Tian, Kaiwen Zhou, and Anthony Man-Cho So · 2022
Later among the works it cites.
Moreau envelope augmented lagrangian method for nonconvex optimization with linear constraints
Jinshan Zeng, Wotao Yin, and Ding-Xuan Zhou · 2022
Later among the works it cites.
A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
Jiawei Zhang and Zhi-Quan Luo · 2022
Later among the works it cites.
Jiawei Zhang, Wenqiang Pu, and Zhi-Quan Luo · 2022
Later among the works it cites.
Lower bounds for non-convex stochastic optimization
Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake Woodworth · 2023
Closest in time.
Albert S. Berahas, Miaolan Xie, and Baoyu Zhou · 2023
Closest in time.
Stochastic first-order methods for convex and nonconvex functional constrained optimization
Digvijay Boob, Qi Deng, and Guanghui Lan · 2023
Closest in time.
Faster gradient-free algorithms for nonsmooth nonconvex stochastic optimization
Lesi Chen, Jing Xu, and Luo Luo · 2023
Closest in time.
Iteration complexity of a proximal augmented lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints
Weiwei Kong, Jefferson G. Melo, and Renato D.C. Monteiro · 2023
Closest in time.
Iteration complexity of an inner accelerated inexact proximal augmented lagrangian method based on the classical lagrangian function
Weiwei Kong, Jefferson G. Melo, and Renato D.C. Monteiro · 2023
Closest in time.
An accelerated inexact dampened augmented lagrangian method for linearly-constrained nonconvex composite optimization problems
Weiwei Kong and Renato D.C. Monteiro · 2023
Closest in time.
An adaptive superfast inexact proximal augmented lagrangian method for smooth nonconvex composite optimization problems
Arnesh Sujanani and Renato D.C. Monteiro · 2023
Closest in time.