Hessian barrier algorithms for non-convex conic optimization

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Relative entropy optimization and its applications
A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
A first-order interior-point method for linearly constrained smooth optimization
A note on the complexity of \(L _{p }\) minimization
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
Complexity bounds for second-order optimality in unconstrained optimization
Lectures on convex optimization
Centro-affine hypersurface immersions with parallel cubic form
Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
On affine scaling algorithms for nonconvex quadratic programming
Characterization of the barrier parameter of homogeneous convex cones
A note on the convergence of barrier algorithms to second-order necessary points
Second-order cone programming
Self-scaled barrier functions on symmetric cones and their classification
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
Minimizing uniformly convex functions by cubic regularization of Newton method
On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
Lower bounds for finding stationary points I
Lower bounds for finding stationary points II: first-order methods
Optimality conditions and global convergence for nonlinear semidefinite programming
First-order and stochastic optimization methods for machine learning
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Complexity of unconstrained \(L_2 - L_p\) minimization
Jordan-algebraic aspects of nonconvex optimization over symmetric cones
Cubic regularization of Newton method and its global performance
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
A mathematical view of interior-point methods in convex optimization
Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Linearly Constrained Non-Lipschitz Optimization for Image Restoration
Several Jordan-algebraic aspects of optimization†
A group bridge approach for variable selection
The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Trust Region Methods
On High-order Model Regularization for Constrained Optimization
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
On Regularization and Active-set Methods with Complexity for Constrained Optimization
Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Hessian Riemannian Gradient Flows in Convex Programming
A second-order sequential optimality condition associated to the convergence of optimization algorithms
A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
Finding approximate local minima faster than gradient descent
On the complexity of an augmented Lagrangian method for nonconvex optimization
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
Hessian Barrier Algorithms for Linearly Constrained Optimization Problems
Canonical Barriers on Convex Cones
This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
Second‐Order Cone Programming Relaxation of Sensor Network Localization
Complexity and performance of an Augmented Lagrangian algorithm
Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method
On Optimality Conditions for Nonlinear Conic Programming
Recent Theoretical Advances in Non-Convex Optimization

This page was built for publication: Hessian barrier algorithms for non-convex conic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665383)