Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A two-cut approach in the analytic center cutting plane method

From MaRDI portal
Publication:1299931
Jump to:navigation, search

DOI10.1007/s186-1999-8372-7zbMath0945.90083OpenAlexW1519365202MaRDI QIDQ1299931

Jean-Philippe Vial, Jean-Louis Goffin

Publication date: 7 September 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s186-1999-8372-7


zbMATH Keywords

analytic centercutting plane methodprimal Newton algorithmtwo cuts


Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, parametric optimization (90C31)


Related Items (2)

A cutting plane method for solving KYP-SDPs ⋮ Specialized fast algorithms for IQC feasibility and optimization problems.


Uses Software

  • ACCPM



This page was built for publication: A two-cut approach in the analytic center cutting plane method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1299931&oldid=13407321"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki