Cover Image

From an Interior Point to a Corner Point: Smart Crossover

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ge, Dongdong, Wang, Chengwenjian, Xiong, Zikai, Ye, Yinyu
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control 90C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
by: Brilli, Andrea, et al.
Published: (2024)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise
by: Dezfulian, Shima, et al.
Published: (2024)

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

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

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

An Interior-Point Algorithm for Continuous Nonlinearly Constrained Optimization with Noisy Function and Derivative Evaluations
by: Curtis, Frank E., et al.
Published: (2025)

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

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

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
by: Wright, Stephen J.
Published: (2001)

Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers
by: Chu, Ya-Chi, et al.
Published: (2024)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
by: Zhu, Kehan, et al.
Published: (2026)

A Second-Order Algorithm Based on Affine Scaling Interior-Point Methods for nonlinear Optimisation with bound constraints
by: Pei, Yonggang, et al.
Published: (2026)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
by: Dolgopolik, M. V.
Published: (2017)

Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2023)

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

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

Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024)

Low-Rank Multi-Objective Linear Programming
by: Löhne, Andreas, et al.
Published: (2025)

Continuity in Parametric Linear Programming
by: Lahiri, Somdeb
Published: (2024)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

Penalty Interior-Point Method Fails to Converge
by: Leyffer, Sven
Published: (2003)

How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning : The Upside of Data Heterogeneity
by: Zhu, Mingxi, et al.
Published: (2022)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
by: Marshall, Luke, et al.
Published: (2026)

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

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)

A Technical Note on the Implementation and Use of PDCS
by: Lin, Zhenwei, et al.
Published: (2026)

Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification
by: Ueda, Ryota, et al.
Published: (2025)

Fixed Topology Minimum-Length Trees with Neighborhoods
by: Blanco, Víctor, et al.
Published: (2024)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
by: Sun, Tianxiao, et al.
Published: (2026)

A dimension reduction procedure for the selection of Two-spring lattice-spring topologies with minimal fabrication cost and required weighted force-resistance performance
by: Makarenkov, Egor
Published: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)