A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a contai...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on optimization Vol. 8; no. 4; pp. 1108 - 1131
Main Authors Mokhtarian, F. Sharifi, Goffin, J. L.
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.11.1998
Subjects
Algorithms
Feasibility
Localization
Polytopes
Online AccessGet full text
ISSN1052-6234
1095-7189
DOI10.1137/51052623496311880

Cover

Abstract A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated by adding a new cut through a test point. Each test point is an approximate analytic center of the intersection of a containing polytope and a level set of the nonlinear objective function. We establish the complexity of the algorithm. Our complexity estimate is given in terms of the problem dimension, the desired accuracy of an approximate solution, and other parameters that depend on the geometry of a specific instance of the problem.
AbstractList A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated by adding a new cut through a test point. Each test point is an approximate analytic center of the intersection of a containing polytope and a level set of the nonlinear objective function. We establish the complexity of the algorithm. Our complexity estimate is given in terms of the problem dimension, the desired accuracy of an approximate solution, and other parameters that depend on the geometry of a specific instance of the problem.
Author Mokhtarian, F. Sharifi
Goffin, J. L.
Author_xml – sequence: 1
  givenname: F. Sharifi
  surname: Mokhtarian
  fullname: Mokhtarian, F. Sharifi
– sequence: 2
  givenname: J. L.
  surname: Goffin
  fullname: Goffin, J. L.
BookMark eNp9kD1PwzAQhi1UJNrCD2Cz2ANnx4ntsYr4kgp0gIkhcsylpErsYruI_ntaYAKJ6V7pnuekeydk5LxDQk4ZnDOWy4uCQcFLngtd5owpBQdkzEAXmWRKj_a54Nl-f0QmMa4AQOlSjcnzjN5713cOTaAzZ_pt6iyt0CUMtNqk1LklXfTGIb3D9OpfaOsDNbTqTYzUt7Ty7h0_6CL4ZTDD8IUH3_Q4xGNy2Jo-4snPnJKnq8vH6iabP1zfVrN5ZrmElJUloGxANXnDlEDDkTdatFLzUihQyihjpNXC5mAFApa8AYG5to2VTIoin5Kz77vr4N82GFO98puw-yXWmgPkUolyB7FvyAYfY8C2XoduMGFbM6j3FdZ_Ktw58pdju2RS510Kpuv_MT8BkCN1CQ
CitedBy_id crossref_primary_10_1287_moor_1040_0116
crossref_primary_10_1080_1055678021000060829a
crossref_primary_10_1080_02331934_2016_1193863
crossref_primary_10_1080_10556788_2015_1025134
crossref_primary_10_1016_j_amc_2006_05_132
crossref_primary_10_1016_j_amc_2008_11_019
crossref_primary_10_1186_s13660_018_1666_2
crossref_primary_10_1016_j_ejor_2015_05_066
crossref_primary_10_1080_02331930008844509
crossref_primary_10_1016_j_cor_2013_09_008
crossref_primary_10_1137_S1052623497324813
crossref_primary_10_1080_10556780310001607956
crossref_primary_10_1137_51052623496311880
Cites_doi 10.1016/S0025-5610(96)00037-8
10.1137/S1052623493258635
10.1007/BF00249055
10.1007/s10107980011a
10.1016/S0025-5610(96)00075-5
10.1287/moor.8.1.135
10.1016/0025-5610(94)00069-6
10.1137/S1052623495294943
10.1137/0802002
10.1007/BF01580859
10.1287/mnsc.38.2.284
10.1016/0025-5610(94)00063-Y
10.1016/0025-5610(94)00064-Z
10.1016/0166-218X(94)90198-8
10.1137/51052623496311880
10.1090/qam/135625
10.1016/0377-2217(93)90129-B
10.1007/BF02032162
10.1137/S1052623494275768
ContentType Journal Article
Copyright [Copyright] © 1998 Society for Industrial and Applied Mathematics
Copyright_xml – notice: [Copyright] © 1998 Society for Industrial and Applied Mathematics
DBID AAYXX
CITATION
3V.
7RQ
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
U9A
DOI 10.1137/51052623496311880
DatabaseName CrossRef
ProQuest Central (Corporate)
Career & Technical Education Database
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection
ProQuest SciTech Premium Collection Natural Science Collection Agricultural & Environmental Science Collection
ProQuest Central Essentials
ProQuest SciTech Premium Collection Natural Science Collection Biological Science Collection
ProQuest Central
ProQuest Business Premium Collection
Technology Collection
Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
ProQuest SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Biological Sciences
ABI/INFORM Global
Agricultural Science Database
Computing Database
Military Database
Research Library
Science Database
Telecommunications Database
Biological Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Agricultural Science Database
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest Career and Technical Education
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1095-7189
EndPage 1131
ExternalDocumentID 2579642081
10_1137_51052623496311880
GroupedDBID -~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
AAYOK
AAYXX
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABUWG
ACGFO
ACGOD
ACIWK
ACPRK
ACUHS
ADBBV
AEMOZ
AENEX
AFFNX
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CITATION
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EBR
EBS
EBU
EDO
EJD
EMK
EST
ESX
F5P
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K1G
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RNS
RSI
TH9
TN5
TUS
TWZ
YNT
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQGLB
PQUKI
PRINS
Q9U
U9A
ID FETCH-LOGICAL-c270t-660e7b08b3b184ea2e2b94f792648088a8aa7c94c30c4e0e62b04e39cbc717453
IEDL.DBID 8FG
ISSN 1052-6234
IngestDate Sat Aug 23 01:10:36 EDT 2025
Tue Jul 01 04:05:24 EDT 2025
Thu Apr 24 22:55:09 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c270t-660e7b08b3b184ea2e2b94f792648088a8aa7c94c30c4e0e62b04e39cbc717453
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 920037846
PQPubID 666300
PageCount 24
ParticipantIDs proquest_journals_920037846
crossref_primary_10_1137_51052623496311880
crossref_citationtrail_10_1137_51052623496311880
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 19981101
PublicationDateYYYYMMDD 1998-11-01
PublicationDate_xml – month: 11
  year: 1998
  text: 19981101
  day: 01
PublicationDecade 1990
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle SIAM journal on optimization
PublicationYear 1998
Publisher Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial and Applied Mathematics
References R2
R3
R4
Goffin Jean‐Louis (R15) 1999; 84
R6
Wolfe Ph. (R24) 1961; 19
R9
R10
R21
R12
R23
R11
R14
R25
R16
R26
R17
R19
R1
References_xml – ident: R10
  doi: 10.1016/S0025-5610(96)00037-8
– ident: R14
  doi: 10.1137/S1052623493258635
– ident: R1
  doi: 10.1007/BF00249055
– volume: 84
  start-page: 89
  year: 1999
  ident: R15
  publication-title: Math. Program.
  doi: 10.1007/s10107980011a
– ident: R26
  doi: 10.1016/S0025-5610(96)00075-5
– ident: R9
  doi: 10.1287/moor.8.1.135
– ident: R19
  doi: 10.1016/0025-5610(94)00069-6
– ident: R17
  doi: 10.1137/S1052623495294943
– ident: R25
  doi: 10.1137/0802002
– ident: R23
  doi: 10.1007/BF01580859
– ident: R11
  doi: 10.1287/mnsc.38.2.284
– ident: R2
  doi: 10.1016/0025-5610(94)00063-Y
– ident: R3
  doi: 10.1016/0025-5610(94)00064-Z
– ident: R4
  doi: 10.1016/0166-218X(94)90198-8
– ident: R21
  doi: 10.1137/51052623496311880
– volume: 19
  start-page: 239
  year: 1961
  ident: R24
  publication-title: Quart. Appl. Math.
  doi: 10.1090/qam/135625
– ident: R12
  doi: 10.1016/0377-2217(93)90129-B
– ident: R6
  doi: 10.1007/BF02032162
– ident: R16
  doi: 10.1137/S1052623494275768
SSID ssj0008968
Score 1.6096661
Snippet A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 1108
SubjectTerms Algorithms
Feasibility
Localization
Polytopes
Title A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
URI https://www.proquest.com/docview/920037846
Volume 8
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Na8MgGJatvWyHsU_WdSsedhpIjZoYT6Mr7cqgpYwVCjsENfa09Sst7OdPjQ0rgx5j9KKv74c-Pg8Aj1QpYiM3R1xojRg3OZJSJiiOc5oSppj2PN3DUTKYsLdpPA3YnCLAKnc-0TvqfKHdGXlbOBQVt9HyeblCTjTKXa4GBY1jUI9soHEGnvZfK0ecivASLibIRnkWLjUjytsurSCuzdpf5CjJ9sPSvlf2oaZ_Ds5Cjgg75aJegCMzvwSnf5gD7dewolstrsBnB45Kygu5hp5mxLZDd3Br1rC79dBm6OSJDBx6xWhoU1UooVfEhIsZ7Drs-Q8cl2Ctb9-9VJoprsGk3_voDlBQTUCacLxBSYINVzhVVNnqzUhiiBJsxoXDslmfIlMpuRZMU6yZwSYhCjNDhVbalnYspjegNl_MzS2A0SxhkYlzg11XbUSko9gOtjmFrRpV0gB4N2mZDpTiTtniK_OlBeXZv3lugKdqyLLk0zjUublbiSxsrSKrDOHu4N8mOPHPB_2zwXtQ26y35sHmDxvV8lbSAvWX3mj8_gtiMsCo
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELYqGIAB8RRQHh5gQbJIbCeOB4SqQmmBVgytVIkh2K47QQt9CPhR_EfOTlJRIbF1jHNe7PM97LvvQ-iUaU3BcwsipDGEC9sjSqmYRFGPJZRrbjxOd7MV1zv8rht1S-i76IVxZZWFTfSGujc07o78QroqKgHe8urtnTjSKPe4WjBoZFpxb78-IGMbXzauYXvPKK3dtKt1kpMKEENFMCFxHFihg0QzDcmNVdRSLXlfSFfqBUdOJUoJI7lhgeE2sDHVAbdMGm0g8-GOJAIs_jJnTLoKwqR2OzP8icw77yJKIKrg-SNqyMSFC2OoGwN9Dx0E2rwbnPcC3rXVNtB6HpPiSqZEm6hkB1to7RdSIXw1Z_Cu4230VMGtDGJDjbCHNYFx7C6K7QhXp76UGjs6JIubnqEaQ2iMFfYMnHjYx1VX6_6JH7PisFcvnjHbjHdQZyELuouWBsOB3UM47Mc8tFHPBk7UWBmaMILJEMNAlqrjfRQUi5aaHMLcMWm8pD6VYSL9s8776Hw25S3D7_hPuFzsRJof5XE6U7yDf_-eoJV6u_mQPjRa92W06lsXfcviIVqajKb2CGKXiT72GoPR86JV9Adf7Pr2
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Nonlinear+Analytic+Center+Cutting+Plane+Method+for+a+Class+of+Convex+Programming+Problems&rft.jtitle=SIAM+journal+on+optimization&rft.au=Mokhtarian%2C+F.+Sharifi&rft.au=Goffin%2C+J.+L.&rft.date=1998-11-01&rft.issn=1052-6234&rft.eissn=1095-7189&rft.volume=8&rft.issue=4&rft.spage=1108&rft.epage=1131&rft_id=info:doi/10.1137%2F51052623496311880&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_51052623496311880
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1052-6234&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1052-6234&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1052-6234&client=summon