The Convergent Generalized Central Paths for Linearly Constrained Convex Programming

QR Code

The Convergent Generalized Central Paths for Linearly Constrained Convex Programming

The convergence of central paths has been a focal point of research on interior point methods. Quite detailed analyses have been made for the linear case. However, when it comes to the convex case, even if the constraints remain linear, the problem is unsettled. In [Math. Program., 103 (2005), pp. 6...

Full description

Bibliographic Details
Main Authors:	Qian, X., Liao, L., Sun, Jie, Zhu, H.
Format:	Journal Article
Published:	Society for Industrial and Applied Mathematics 2018
Online Access:	http://purl.org/au-research/grants/arc/DP160102819 http://hdl.handle.net/20.500.11937/69781

Similar Items

An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
by: Hou, L., et al.
Published: (2022)

A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
by: Qian, X., et al.
Published: (2018)

Successive Convex Approximations to Cardinality-Constrained Convex Programs: A Piecewise-Linear DC Approach
by: Zheng, X., et al.
Published: (2014)

Analysis of some interior point continuous trajectories for convex programming
by: Qian, X., et al.
Published: (2017)

A Method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
by: Mehrotra, S., et al.
Published: (1991)

A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
by: Sun, Jie, et al.
Published: (2010)

A model of distributionally robust two-stage stochastic convex programming with linear recourse
by: Li, Bin, et al.
Published: (2018)

Constrained model predictive control on convex polyhedron stochastic linear parameter varying systems
by: Yin, YanYan, et al.
Published: (2013)

Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
by: Dang, Y., et al.
Published: (2016)

Exploiting layerwise convexity of rectifier networks with sign constrained weights
by: An, Senjian, et al.
Published: (2018)

Convergence of the Steepest Descent Method for Minimizing Convex Functions
by: Abu Hassan, Malik, et al.
Published: (2002)

An alternating direction method for solving convex nonlinear semidefinite programming problems
by: Zhang, S., et al.
Published: (2013)

On the Structure of Convex Piecewise Quadratic Functions
by: Sun, Jie
Published: (1992)

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
by: Mehrotra, S., et al.
Published: (1990)

The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
by: Sun, D., et al.
Published: (2008)

Notions of generalized s-convex functions on fractal sets
by: Kilicman, Adem, et al.
Published: (2015)

Generalized geodesic convex functions on Riemannian manifolds
by: Kilicman, Adem, et al.
Published: (2019)

Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions
by: Liu, X., et al.
Published: (2005)

RATIONAL GENERALIZED BALL FUNCTIONS FOR CONVEX INTERPOLATING CURVES
by: ABDUL KARIM, SAMSUL ARIFFIN
Published: (2009)

Minimum recession-compatible subsets of closed convex sets
by: He, Y., et al.
Published: (2012)

Robust Stochastic Optimization With Convex Risk Measures: A Discretized Subgradient Scheme
by: Yu, H., et al.
Published: (2021)

Characterizations of robust solution set of convex programs with uncertain data
by: Li, X., et al.
Published: (2017)

Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021)

Discrete Path Planning for Convex Polyhedra through Edge-Rolling on a Plane
by: Lam, Ngoc Tam
Published: (2022)

Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment
by: Wong, Peng Kiong
Published: (2004)

Novel algorithm for mobile robot path planning in constrained environment
by: Muhammad, Aisha, et al.
Published: (2022)

An augmented lagrangian decomposition method for chance-constrained optimization problems
by: Bai, X., et al.
Published: (2021)

On product of generalized s-convex functions and new inequalities on fractal sets
by: Kilicman, Adem, et al.
Published: (2017)

On some inequalities for generalized s-convex functions and applications on fractal sets
by: Kilicman, Adem, et al.
Published: (2017)

Some generalized Hermite-Hadamardtype integral inequalities for generalizeds-convex functions on fractal sets
by: Kilicman, Adem, et al.
Published: (2015)

Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints
by: Liu, X., et al.
Published: (2004)

Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method
by: Sun, Jie, et al.
Published: (2006)

Non-differentiable second order symmetric duality in mathematical programming with F-convexity
by: Yang, X., et al.
Published: (2003)

A generalized class of close-to-convex functions / Shaharuddin Cik Soh
by: Cik Soh, Shaharuddin
Published: (2009)

Integral inequalities for s-convexity via generalized fractional integrals on fractal sets
by: Almutairi, Ohud, et al.
Published: (2020)

A robust SQP method for mathematical programs with linear complementarity constraints
by: Liu, X., et al.
Published: (2006)

An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints
by: Li, J., et al.
Published: (2015)

Robust two-stage stochastic linear programs with moment constraints
by: Gao, S., et al.
Published: (2014)

Special issue on recent advances in next-generation and resource-constrained converged networks
by: Amin, Syed Obaid, et al.
Published: (2011)

A case of partial convergence: the Europeanization of central government in Central and Eastern Europe
by: Meyer-Sahling, Jan-Hinrik, et al.
Published: (2015)

Cannot write session to /tmp/vufind_sessions/sess_5c2teaa7an79a9tmgukpoic111