Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Interior path following primal-dual algorithms. Part II: Convex quadratic programming

Published: 22 June 1989 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2024)Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output SizeACM Transactions on Database Systems10.1145/370572650:1(1-37)Online publication date: 22-Nov-2024
  • (2024)Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasksMachine Language10.1007/s10994-024-06596-x113:10(7807-7840)Online publication date: 5-Sep-2024
  • (2023)Multi-View Discrete Clustering: A Concise ModelIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2023.331970045:12(15154-15170)Online publication date: 1-Dec-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Mathematical Programming: Series A and B
Mathematical Programming: Series A and B  Volume 44, Issue 1
1989
117 pages

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 June 1989

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output SizeACM Transactions on Database Systems10.1145/370572650:1(1-37)Online publication date: 22-Nov-2024
  • (2024)Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasksMachine Language10.1007/s10994-024-06596-x113:10(7807-7840)Online publication date: 5-Sep-2024
  • (2023)Multi-View Discrete Clustering: A Concise ModelIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2023.331970045:12(15154-15170)Online publication date: 1-Dec-2023
  • (2022)An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex ProgrammingJournal of Scientific Computing10.1007/s10915-022-01765-390:3Online publication date: 1-Mar-2022
  • (2022)An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methodsMathematical Programming: Series A and B10.1007/s10107-021-01692-5195:1-2(327-366)Online publication date: 1-Sep-2022
  • (2021)MOCCAACM Transactions on Graphics10.1145/3450626.345968040:4(1-14)Online publication date: 19-Jul-2021
  • (2020)Detecting outliers with one-class selective transfer machineKnowledge and Information Systems10.1007/s10115-019-01407-562:5(1781-1818)Online publication date: 1-May-2020
  • (2020)The Adaptation of Interior Point Method for Solving the Quadratic Programming Problems Arising in the Assembly of Deformable StructuresOptimization and Applications10.1007/978-3-030-62867-3_19(257-271)Online publication date: 28-Sep-2020
  • (2019)Creating top ranking options in the continuous option and preference spaceProceedings of the VLDB Endowment10.14778/3339490.333950012:10(1181-1194)Online publication date: 1-Jun-2019
  • (2019)Resource-aware networked control systems under temporal logic specificationsDiscrete Event Dynamic Systems10.1007/s10626-019-00297-729:4(473-499)Online publication date: 1-Dec-2019
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media