A polynomial time infeasible interior-point arc-search algorithm for convex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Yang, Yaguang
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control 90C51 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
by: Yang, Yaguang
Published: (2024)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2026)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
by: Iida, Einosuke, et al.
Published: (2023)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

On Second-Order Cone Functions
by: Jibrin, Shafiu, et al.
Published: (2023)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
by: Sakabe, Keiya
Published: (2026)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

Dual certificates of primal cone membership
by: Lee, Joonyeob, et al.
Published: (2025)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
by: Heeman, Pim, et al.
Published: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Stochastic interior-point methods for smooth conic optimization with applications
by: He, Chuan, et al.
Published: (2024)

Forward-Backward algorithms for weakly convex problems
by: Bednarczuk, Ewa, et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
by: Sim, Chee-Khian
Published: (2022)

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
by: -Nagy, Marianna E., et al.
Published: (2025)

Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

Riemannian Interior Point Methods for Constrained Optimization on Manifolds
by: Lai, Zhijian, et al.
Published: (2022)

Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
by: Chen, Zhongzhu, et al.
Published: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

A quantum dual logarithmic barrier method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

On the convergence of critical points on real algebraic sets and applications to optimization
by: Basu, Saugata, et al.
Published: (2025)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)

An algorithm for minimum cardinality generators of cones
by: Mayer, Matthias Georg, et al.
Published: (2024)