Interior dual proximal point algorithm for linear programs

Interior dual proximal point algorithm for linear programs

European Journal of Operational Research

Saved in:

Bibliographic Details
Main Author:	Setiono, R.
Other Authors:	INFORMATION SYSTEMS & COMPUTER SCIENCE
Format:	Article
Published:	2014
Subjects:	Barrier methods Karmarkar Linear programming Newton method Proximal point method
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/99318
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

Similar Items

Interior proximal point algorithm for linear programs
by: Setiono, R.
Published: (2014)

Solving linear programming problems by the interior-point method
by: Sa-at Moungjun
Published: (2009)

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

An implementable proximal point algorithmic framework for nuclear norm minimization
by: Liu, Y.-J., et al.
Published: (2014)

On strongly convergent parallel proximal point algorithms
by: Pham, Ky Anh, et al.
Published: (2017)

On the log-exponential trajectory of linear programming
by: Sun, J., et al.
Published: (2013)

Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
by: Wang, C., et al.
Published: (2014)

Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
by: Chai, J.-S., et al.
Published: (2014)

On controlling the parameter in the logarithmic barrier term for convex programming problems
by: Kortanek, K.O., et al.
Published: (2014)

A proximal point algorithm for log-determinant optimization with group Lasso regularization
by: Yang, J., et al.
Published: (2014)

Interior-point methods with decomposition for solving large-scale linear programs
by: Zhao, G.Y.
Published: (2014)

Some new search directions for primal-dual interior point methods in semidefinite programming
by: Toh, K.-C.
Published: (2014)

A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
by: Liu, X., et al.
Published: (2013)

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

Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
by: Liu, X.W., et al.
Published: (2013)

On the Nesterov-Todd direction in semidefinite programming
by: Todd, M.J., et al.
Published: (2014)

Nonsmooth multiobjective programming with quasi-Newton methods
by: Qu, S., et al.
Published: (2014)

Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems
by: JIANG KAIFENG
Published: (2012)

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

A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
by: Zhao, G.
Published: (2014)

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

Interior-point methods for minimization of potential energy functions of polypeptides
by: MUTHU SOLAYAPPAN
Published: (2013)

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
by: Zhou, G., et al.
Published: (2014)

A note on the calculation of step-lengths in interior-point methods for semidefinite programming
by: Toh, K.-C.
Published: (2014)

Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
by: LI LU
Published: (2011)

Parallel Interior Point Schemes for Solving Multistage Convex Programming
by: Hegland, M., et al.
Published: (2013)

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
by: Zhou, G., et al.
Published: (2014)

Applying a Newton method to strictly convex separable network quadratic programs
by: Sun, J., et al.
Published: (2013)

Computation of condition numbers for linear programming problems using Peña's method
by: Chai, J.-S., et al.
Published: (2014)

Semismooth Newton methods for solving semi-infinite programming problems
by: Qi, L., et al.
Published: (2016)

A proximal point algorithm for sequential feature extraction applications
by: Doan, X.V., et al.
Published: (2014)

EFFICIENT SECOND-ORDER ALGORITHMS FOR STRUCTURED CONVEX COMPOSITE PROGRAMMING
by: LIN MEIXIA
Published: (2020)

On methods for solving nonlinear semidefinite optimization problems
by: Sun, J.
Published: (2014)

A Semismooth Newton-CG Augmented Lagrangian Method for Large Scale Linear and Convex Quadratic SDPS
by: ZHAO XINYUAN
Published: (2010)

Scaling down of petroleum distillation simulation
by: Patcharee Wongjirasawad
Published: (2008)

A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
by: Huang, Z.-H., et al.
Published: (2014)

A neural network construction algorithm with application to image compression
by: Setiono, R., et al.
Published: (2014)

A simplex method and its implementation for network piecewise linear programming
by: Sun, J., et al.
Published: (2013)

A newton-cg augmented lagrangian method for semidefinite programming
by: Zhao, X.-Y., et al.
Published: (2014)

An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
by: Qi, H., et al.
Published: (2014)