Fetching the paper…
Reading the bibliography…
We consider the minimization of a continuous function over the intersection of a regular cone with an affine set via a new class of adaptive first- and second-order optimization methods, building on the Hessian-barrier techniques introduced in [Bomze, Mertikopoulos, Schachinger, and Staudigl, Hessian barrier algorithms for linearly constrained optimization problems, SIAM Journal on Optimization, 2019].
Several jordan-algebraic aspects of optimization
L. Faybusovich · 1934
Earlier work this paper cites.
The modification of newton’s method for unconstrained optimization by bounding cubic terms
Andreas Griewank · 1981
Earlier work this paper cites.
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Anthony V. Fiacco and G. P. McCormick · 1990
Earlier work this paper cites.
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Ilan Adler and Renato DC Monteiro · 1991
Earlier work this paper cites.
On affine scaling algorithms for nonconvex quadratic programming
Yinyu Ye · 1992
Earlier work this paper cites.
Analysis on symmetric cones
Jacques Faraut and Adam Koranyi · 1994
Earlier work this paper cites.
Interior Point Polynomial methods in Convex programming
Yu. Nesterov and A. Nemirovski · 1994
Earlier work this paper cites.
Optimization and Dynamical Systems
Uwe Helmke and John B. Moore · 1996
Earlier work this paper cites.
Self-scaled barriers and interior-point methods for convex programming
Yu. E. Nesterov and M. J. Todd · 1997
Earlier work this paper cites.
Characterization of the barrier parameter of homogeneous convex cones
Osman Güler and Levent Tunçel · 1998
Earlier work this paper cites.
Trust Region Methods
Andrew Conn, Nicholas Gould, and Philippe Toint · 2000
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen J. Wright · 2000
Earlier work this paper cites.
Lectures on Modern Convex Optimization
Aharon Ben-Tal and Arkadi Nemirovski · 2001
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
Jianquing Fan and Runze Li · 2001
Earlier work this paper cites.
A Mathematical View of Interior-Point Methods in Convex Optimization
James Renegar · 2001
Earlier work this paper cites.
Self-scaled barrier functions on symmetric cones and their classification
Raphael A. Hauser and Osman Güler · 2002
Earlier work this paper cites.
Second-order cone programming
Farid Alizadeh and Donald Goldfarb · 2003
Earlier work this paper cites.
Barrier operators and associated gradient-like dynamical systems for constrained minimization problems
J. Bolte and M. Teboulle · 2003
Earlier work this paper cites.
Extension of primal-dual interior point algorithms to symmetric cones
S. H. Schmieta and F. Alizadeh · 2003
Earlier work this paper cites.
Hessian Riemannian gradient flows in convex programming
Felipe Alvarez, Jérôme Bolte, and Olivier Brahic · 2004
Earlier work this paper cites.
Semidefinite programming and integer programming
Monique Laurent and Franz Rendl · 2005
Earlier work this paper cites.
Aspects of semidefinite programming: interior point algorithms and selected applications , volume 65
Etienne De Klerk · 2006
Earlier work this paper cites.
Jordan-algebraic aspects of nonconvex optimization over symmetric cones
Leonid Faybusovich and Ye Lu · 2006
Cited alongside, same era.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris Polyak · 2006
Cited alongside, same era.
An interior-point trust-region algorithm for general symmetric cone programming
Ye Lu and Ya-Xiang Yuan · 2007
Cited alongside, same era.
Second-order cone programming relaxation of sensor network localization
Paul Tseng · 2007
Cited alongside, same era.
Sparsest solutions of underdetermined linear systems via ℓ q \ell_{q} -minimization for 0 < q ≤ 1 0<q\leq 1
Simon Foucart and Ming-Jun Lai · 2008
Cited alongside, same era.
Cones and interior-point algorithms for structured convex optimization involving powers andexponentials
On regularization and active-set methods with complexity for constrained optimization
E. G. Birgin and J. M. Martínez · 2018
Later among the works it cites.
Second-order optimality and beyond: Characterization and evaluation complexity in convexly constrained nonlinear optimization
Coralia Cartis, Nick I. M. Gould, and Philippe L. Toint · 2018
Later among the works it cites.
Complexity analysis of a trust funnel algorithm for equality constrained optimization
Frank E. Curtis, Daniel P. Robinson, and Mohammadreza Samadi · 2018
Later among the works it cites.
Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints
Oliver Hinder and Yinyu Ye · 2018
Later among the works it cites.
Lectures on Convex Optimization , volume 137 of Springer Optimization and Its Applications
Yurii Nesterov · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robert Chares · 2009
Cited alongside, same era.
A group bridge approach for variable selection
Jian Huang, Shuange Ma, Huiliange Xie, and Cun-Hui Zhang · 2009
Cited alongside, same era.
Complexity bounds for second-order optimality in unconstrained optimization
C. Cartis, N.I.M. Gould, and Ph.L. Toint · 2011
Cited alongside, same era.
Adaptive cubic regularisation methods for unconstrained optimization. part i: motivation, convergence and numerical results
Coralia Cartis, Nicholas I. M. Gould, and Philippe L. Toint · 2011
Cited alongside, same era.
A note on the complexity of l p l_{p} minimization
Dongdong Ge, Xiaoye Jiang, and Yinyu Ye · 2011
Cited alongside, same era.
A first-order interior-point method for linearly constrained smooth optimization
Paul Tseng, Immanuel M. Bomze, and Werner Schachinger · 2011
Cited alongside, same era.
Worst-case complexity of smoothing quadratic regularization methods for non-lipschitzian optimization
Wei Bian and Xiaojun Chen · 2013
Cited alongside, same era.
A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning
Fei Wen, Lei Chu, Peilin Liu, and Robert C. Qiu · 2018
Later among the works it cites.
Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
Roberto Andreani, Ellen H Fukuda, Gabriel Haeser, Daiana O Santos, and Leonardo D Secchin · 2019
Later among the works it cites.
Hessian barrier algorithms for linearly constrained optimization problems
Immanuel M Bomze, Panayotis Mertikopoulos, Werner Schachinger, and Mathias Staudigl · 2019
Later among the works it cites.
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Gabriel Haeser, Hongcheng Liu, and Yinyu Ye · 2019
Later among the works it cites.
A survey of relaxations and approximations of the power flow equations
Daniel K. Molzahn and Ian A. Hiskens · 2019
Later among the works it cites.
Complexity and performance of an augmented lagrangian algorithm
E. G. Birgin and J. M. Martínez · 2020
Later among the works it cites.
On the complexity of an augmented Lagrangian method for nonconvex optimization
Geovani Nunes Grapiglia and Ya-xiang Yuan · 2020
Later among the works it cites.
First-order and Stochastic Optimization Methods for Machine Learning
Guanghui Lan · 2020
Later among the works it cites.
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
Yurii Nesterov, Alexander Gasnikov, Sergey Guminov, and Pavel Dvurechensky · 2020
Later among the works it cites.
A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
Michael O’Neill and Stephen J Wright · 2020
Later among the works it cites.
On the use of jordan algebras for improving global convergence of an augmented lagrangian method in nonlinear semidefinite programming
R. Andreani, E. H. Fukuda, G. Haeser, D. O. Santos, and L. D. Secchin · 2021
Closest in time.
Universal regularization methods: Varying the power, the smoothness and the accuracy
Coralia Cartis, Nick I. Gould, and Philippe L. Toint · 2021
Closest in time.
Minimizing uniformly convex functions by cubic regularization of newton method
Nikita Doikov and Yurii Nesterov · 2021
Closest in time.
On a combination of alternating minimization and Nesterov’s momentum
Sergey Guminov, Pavel Dvurechensky, Nazarii Tupitsa, and Alexander Gasnikov · 2021
Closest in time.
Generalized self-concordant analysis of frank–wolfe algorithms
Pavel Dvurechensky, Kamil Safin, Shimrit Shtern, and Mathias Staudigl · 2022
Closest in time.
Solving the cubic regularization model by a nested restarting lanczos method
Xiaojing Jia, Xin Liang, Chungen Shen, and Lei-Hong Zhang · 2022
Closest in time.