An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities

Mathematics of Operations Research ◽

10.1287/moor.1040.0116 ◽

2005 ◽

Vol 30 (1) ◽

pp. 127-149 ◽

Author(s):

Mohammad R. Oskoorouchi ◽

Jean-Louis Goffin

Keyword(s):

Interior Point ◽

Cutting Plane ◽

Second Order ◽

Convex Feasibility Problem ◽

Feasibility Problem ◽

Cutting Plane Method ◽

Plane Method ◽

Convex Feasibility ◽

Second Order Cone

Download Full-text

A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem

Optimization Methods and Applications - Applied Optimization ◽

10.1007/978-1-4757-3333-4_10 ◽

2001 ◽

pp. 167-190 ◽

Author(s):

E. D. Andersen ◽

J. E. Mitchell ◽

C. Roos ◽

T. Terlaky

Keyword(s):

Cutting Plane ◽

Convex Feasibility Problem ◽

Feasibility Problem ◽

Cutting Plane Method ◽

Plane Method ◽

Convex Feasibility

Download Full-text

An interior-point/cutting-plane method to solve unit commitment problems

Proceedings of the 21st International Conference on Power Industry Computer Applications. Connecting Utilities. PICA 99. To the Millennium and Beyond (Cat. No.99CH36351) ◽

10.1109/pica.1999.779404 ◽

2003 ◽

Author(s):

M. Madrigal ◽

V.H. Quintana

Keyword(s):

Interior Point ◽

Unit Commitment ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Commitment Problems

Download Full-text

Interior point cutting plane method for optimal power flow

IMA Journal of Management Mathematics ◽

10.1093/imaman/15.4.355 ◽

2004 ◽

Vol 15 (4) ◽

pp. 355-368 ◽

Author(s):

X. Ding

Keyword(s):

Interior Point ◽

Optimal Power Flow ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Download Full-text

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method

Annals of Operations Research ◽

10.1007/bf02206819 ◽

1996 ◽

Vol 62 (1) ◽

pp. 253-276 ◽

Author(s):

John E. Mitchell ◽

Brian Borchers

Keyword(s):

Interior Point ◽

Cutting Plane ◽

Linear Ordering ◽

Cutting Plane Method ◽

Plane Method ◽

Download Full-text

Neurodynamics-based robust pole assignment for synthesizing second-order control systems via output feedback based on a convex feasibility problem reformulation

2014 IEEE International Symposium on Innovations in Intelligent Systems and Applications (INISTA) Proceedings ◽

10.1109/inista.2014.6873589 ◽

2014 ◽

Author(s):

Xinyi Le ◽

Jun Wang ◽

Zheng Yan

Keyword(s):

Control Systems ◽

Output Feedback ◽

Pole Assignment ◽

Second Order ◽

Convex Feasibility Problem ◽

Feasibility Problem ◽

Convex Feasibility ◽

Problem Reformulation

Download Full-text

Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems

SIAM Journal on Optimization ◽

10.1137/s1052623493258635 ◽

1996 ◽

Vol 6 (3) ◽

pp. 638-652 ◽

Author(s):

Jean-Louis Goffin ◽

Zhi-Quan Luo ◽

Yinyu Ye

Keyword(s):

Complexity Analysis ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Convex Feasibility Problems ◽

Convex Feasibility

Download Full-text

An interior-point/cutting-plane method to solve unit commitment problems

IEEE Transactions on Power Systems ◽

10.1109/59.871728 ◽

2000 ◽

Vol 15 (3) ◽

pp. 1022-1027 ◽

Author(s):

M. Madrigal ◽

V.H. Quintana

Keyword(s):

Interior Point ◽

Unit Commitment ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Commitment Problems

Download Full-text

Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem

Mathematical Methods of Operations Research ◽

10.1007/s00186-013-0431-z ◽

2013 ◽

Vol 78 (1) ◽

pp. 35-59 ◽

Author(s):

Alexander Engau ◽

Miguel F. Anjos ◽

Immanuel Bomze

Keyword(s):

Interior Point ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Constraint Selection ◽

Stable Set Problem

Download Full-text

Using an Interior Point Cutting Plane Method to Solve Integer Programming Problems

10.21236/ada256041 ◽

1992 ◽

Author(s):

John E. Mitchell

Keyword(s):

Integer Programming ◽

Interior Point ◽

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Integer Programming Problems

Download Full-text

The integration of an interior-point cutting plane method within a branch-and-price algorithm

Mathematical Programming ◽

10.1007/s10107-003-0469-4 ◽

2004 ◽

Vol 100 (2) ◽

pp. 267-294 ◽

Author(s):

Samir Elhedhli ◽

Jean-Louis Goffin

Keyword(s):

Interior Point ◽

Cutting Plane ◽

Cutting Plane Method ◽

Branch And Price ◽

Plane Method ◽

Price Algorithm

Download Full-text