Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
10.1023/A:1008787027641
Saved in:
Main Authors: | Luo, Z.-Q., Sun, J. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44891 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
An analytic center based column generation algorithm for convex quadratic feasibility problems
by: Luo, Z.-Q., et al.
Published: (2013) -
A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
by: Zhao, G.
Published: (2014) -
Extremal problems, inequalities, and classical orthogonal polynomials
by: Agarwal, R.P., et al.
Published: (2014) -
Effective Ljasiewicz inequality for arithmetically defined varieties and a geometric application to bihomogeneous polynomials
by: To, W.-K., et al.
Published: (2014) -
CONVEX FEASIBILITY PROBLEMS - BEYOND ALTERNATING PROJECTIONS
by: ROSHNI MOHAN NANDWANI
Published: (2021)