Analysis of some interior point continuous trajectories for convex programming

QR Code

Analysis of some interior point continuous trajectories for convex programming

In this paper, we analyse three interior point continuous trajectories for convex programming with general linear constraints. The three continuous trajectories are derived from the primal–dual path-following method, the primal–dual affine scaling method and the central path, respectively. Theoretic...

Full description

Bibliographic Details
Main Authors:	Qian, X., Liao, L., Sun, Jie
Format:	Journal Article
Published:	Taylor & Francis Ltd. 2017
Online Access:	http://hdl.handle.net/20.500.11937/52592

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)

The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
by: Qian, X., et al.
Published: (2018)

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

A robust primal-dual interior-point algorithm for nonlinear programs
by: Liu, X., et al.
Published: (2004)

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

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

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

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

A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
by: Dai, Y.H., et al.
Published: (2020)

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

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)

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

A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
by: Wang, G., et al.
Published: (2013)

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

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

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

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)

A non-interior continuation algorithm for the P0 or P * LCP with strong global and local convergence properties
by: Huang, Z., et al.
Published: (2005)

Hankel determinant for functions starlike and convex with respect to symmetric points
by: Aini Janteng,, et al.
Published: (2006)

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

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

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

Positive solutions for three-point semipositone boundary value problems with convex nonlinearity
by: Zhang, Xinguang
Published: (2009)

Solving continuous trajectory and forward kinematics simultaneously based on ANN
by: Ang, Chun Kit, et al.
Published: (2014)

Optimal point-to-point trajectory tracking of redundant manipulators using generalized pattern search
by: Ata, Atef A, et al.
Published: (2005)

Study review on nominal characteristic trajectory following controller for point-to-point positioning systems
by: Yakub, Mohd Fitri Mohd, et al.
Published: (2012)

Techniques of Vibration And End-Point Trajectory Control of Flexible Manipulator
by: Mohd Ashraf, Ahmad, et al.
Published: (2009)

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

Some new fractal Milne-type integral inequalities via generalized convexity with applications
by: Meftah, Badreddine, et al.
Published: (2023)

Some geometrical aspects of efficient points in vector optimization
by: Zheng, X., et al.
Published: (2007)

Nonnegative polynomial optimization over unit spheres and convex programming relaxations
by: Zhou, Guanglu, et al.
Published: (2012)

Some local fractional inequalities involving fractal sets via generalized exponential (s,m)-convexity
by: Saleh, Wedad, et al.
Published: (2023)

Multiobjective second-order symmetric duality with F -convexity
by: Yang, X., et al.
Published: (2005)

Allometric relationships between traveltime channel networks, convex hulls, and convexity measures
by: Tay, Lea Tien, et al.
Published: (2006)

On geodesic strongly E-convex sets and geodesic strongly E-convex functions
by: Kilicman, Adem, et al.
Published: (2015)

On the minima and convexity of Epstein zeta function
by: Lim, S. C., et al.
Published: (2008)

An Application of Differential Search Algorithm in Solving Non-Convex Economic Dispatch Problems with Valve-Point Effects
by: M. H., Sulaiman
Published: (2013)

Cannot write session to /tmp/vufind_sessions/sess_lekoksl755s8oqb8q9a34slg8l