Search Results - "Mathematical programming computation"

Mathematical Programming Computation (Mpc)

Authors: Dalitz, Wolfgang

Subject Terms: Open Access, Journal, Open Journal Systems (OJS), Open Access Week, FOS: Mathematics, Mathematics

A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs ; Mathematical Programming Computation

Authors: Kannan, Rohit Luedtke, James R.

Subject Terms: Stochastic approximation, Chance constraints, Efficient frontier, Stochastic subgradient

File Description: Pages 705-751; 47 page(s); application/pdf

Relation: https://hdl.handle.net/10919/124622; 13

Availability: https://hdl.handle.net/10919/124622
https://doi.org/10.1007/s12532-020-00199-y

Mathematical Programming Computation

Published In Mathematical Programming Computation, 1, 69-95. Testing Cut Generators for Mixed-Integer Linear Programming

Authors: François Margot The Pennsylvania State University CiteSeerX Archives

Contributors: François Margot The Pennsylvania State University CiteSeerX Archives

Source: http://repository.cmu.edu/cgi/viewcontent.cgi?article%3D1263%26context%3Dtepper.

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1033.3504; http://repository.cmu.edu/cgi/viewcontent.cgi?article%3D1263%26context%3Dtepper

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1033.3504
http://repository.cmu.edu/cgi/viewcontent.cgi?article%3D1263%26context%3Dtepper

Mathematical Programming Computation: A New MPS Journal

Authors: Cook, William Koch, Thorsten

Availability: https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/3262

Network flow-based deterministic and stochastic models for the integrated lot-sizing and scheduling problem with sequence-dependent set-up costs.

Authors: Sangha, Sandeep S. Sarin, Subhash C.

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8816-8844, 29p

A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects.

Authors: Yao, Shaowen Wang, Sunkanghong Zhang, Tai et al.

Source: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8593-8610, 18p

LCQPow: a solver for linear complementarity quadratic programs

Authors: Hall, Jonas Nurkanovic, Armin Messerer, Florian et al.

Source: Mathematical Programming Computation

Subject Terms: Optimization and Control (math.OC), 0211 other engineering and technologies, FOS: Mathematics, 02 engineering and technology, Mathematics - Optimization and Control

Access URL: http://arxiv.org/abs/2211.16341

PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python

Authors: Goujaud, Baptiste Moucer, Céline Glineur, François et al.

Contributors: Goujaud, Baptiste Moucer, Céline Glineur, François et al.

Source: Mathematical Programming Computation, Vol. 16, no.3, p. 337-367 (2024)

Subject Terms: Optimization, FOS: Computer and information sciences, Computer Science - Machine Learning, 0209 industrial biotechnology, Semidefinite programming, 0211 other engineering and technologies, Splitting methods, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 02 engineering and technology, Numerical Analysis (math.NA), Machine Learning (cs.LG), First-order methods, Optimization and Control (math.OC), FOS: Mathematics, Convergence analyses, Computer Science - Mathematical Software, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics - Numerical Analysis, Performance estimation problems, Mathematics - Optimization and Control, Mathematical Software (cs.MS), Worst-case analyses

Access URL: http://arxiv.org/abs/2201.04040
https://hdl.handle.net/2078.1/293047

Efficient algorithms for implementing incremental proximal-point methods

Authors: Shtoff, Alex

Source: Mathematical Programming Computation. 16:423-458

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Optimization and Control (math.OC), 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, 02 engineering and technology, Mathematics - Optimization and Control, Machine Learning (cs.LG)

Access URL: http://arxiv.org/abs/2205.01457

Deterministic global optimization with Gaussian processes embedded

Authors: Dominik Bongartz Tim Kerkenhoff Artur M. Schweidtmann et al.

Source: Mathematical programming computation 13(3), 553-581 (2021). doi:10.1007/s12532-021-00204-y
Mathematical programming computation : MPC 13(3), 553-581 (2021). doi:10.1007/s12532-021-00204-y

Subject Terms: Technology, Mathematics, Applied, FLOWSHEET OPTIMIZATION, Chance-constrained programming, DESIGN, PROGRAMS, 0102 Applied Mathematics, Machine learning, 4901 Applied mathematics, ALGORITHM, STRATEGY, Bayesian optimization, 0802 Computation Theory and Mathematics, Science & Technology, 4602 Artificial intelligence, Operations Research & Management Science, 0103 Numerical and Computational Mathematics, Computer Science, Software Engineering, Reduced-space, Kriging, Expected improvement, SURROGATE MODELS, HYBRID MODELS, Physical Sciences, Computer Science, SIMULATION, Acquisition function, Mathematics

Access URL: https://link.springer.com/content/pdf/10.1007/s12532-021-00204-y.pdf
https://research.tudelft.nl/en/publications/deterministic-global-optimization-with-gaussian-processes-embedde
https://link.springer.com/article/10.1007/s12532-021-00204-y
https://publications.rwth-aachen.de/record/821539
https://link.springer.com/content/pdf/10.1007/s12532-021-00204-y.pdf
https://juser.fz-juelich.de/record/905554
https://publications.rwth-aachen.de/record/821539

Rolling horizon product quality estimation and online optimisation for supply chain management of perishable inventory.

Authors: Lejarza, Fernando Venkatesan, Shashank Baldea, Michael

Source: International Journal of Production Research; May2025, Vol. 63 Issue 10, p3709-3732, 24p

Subject Terms: SUPPLY chain management, INVENTORY control, DYNAMICAL systems, PERISHABLE goods, SUPPLY chains

Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method

Authors: Zhang, Xinyao Han, Shaoning Pang, Jong-Shi et al.

Contributors: Zhang, Xinyao Han, Shaoning Pang, Jong-Shi et al.

Source: Mathematical Programming Computation ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00290-2
https://link.springer.com/content/pdf/10.1007/s12532-025-00290-2.pdf
https://link.springer.com/article/10.1007/s12532-025-00290-2/fulltext.html

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization

Authors: Bomze, Immanuel M. Peng, Bo Qiu, Yuzhou et al.

Source: Mathematical Programming Computation ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00285-z
https://link.springer.com/content/pdf/10.1007/s12532-025-00285-z.pdf
https://link.springer.com/article/10.1007/s12532-025-00285-z/fulltext.html

Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond

Authors: Hojny, Christopher

Source: Mathematical Programming Computation ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00289-9
https://link.springer.com/content/pdf/10.1007/s12532-025-00289-9.pdf
https://link.springer.com/article/10.1007/s12532-025-00289-9/fulltext.html

Multiparent path relinking. An application to the power dominating set problem

Authors: Martín-Santamaría, R. Martínez-Gavara, A. López-Sánchez, A. D. et al.

Contributors: Martín-Santamaría, R. Martínez-Gavara, A. López-Sánchez, A. D. et al.

Source: Mathematical Programming Computation ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00286-y
https://link.springer.com/content/pdf/10.1007/s12532-025-00286-y.pdf
https://link.springer.com/article/10.1007/s12532-025-00286-y/fulltext.html

The smoothed duality gap as a stopping criterion

Authors: Walwil, Iyad Fercoq, Olivier Télécom Paris

Contributors: Walwil, Iyad Fercoq, Olivier Télécom Paris

Source: Mathematical Programming Computation ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00284-0
https://link.springer.com/content/pdf/10.1007/s12532-025-00284-0.pdf
https://link.springer.com/article/10.1007/s12532-025-00284-0/fulltext.html

Instance-specific linear relaxations of semidefinite optimization problems

Authors: de Roux, Daniel Carr, Robert Ravi, R. et al.

Contributors: de Roux, Daniel Carr, Robert Ravi, R. et al.

Source: Mathematical Programming Computation ; volume 17, issue 2, page 385-435 ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00275-1
https://link.springer.com/content/pdf/10.1007/s12532-025-00275-1.pdf
https://link.springer.com/article/10.1007/s12532-025-00275-1/fulltext.html

Polynomial optimization relaxations for generalized semi-infinite programs

Authors: Hu, Xiaomeng Nie, Jiawang

Source: Mathematical Programming Computation ; volume 17, issue 3, page 547-583 ; ISSN 1867-2949 1867-2957

Availability: https://doi.org/10.1007/s12532-025-00280-4
https://link.springer.com/content/pdf/10.1007/s12532-025-00280-4.pdf
https://link.springer.com/article/10.1007/s12532-025-00280-4/fulltext.html

QPLIB: a library of quadratic programming instances

Authors: Furini, Fabio Traversi, Emiliano Belotti, Pietro et al.

Contributors: Furini, Fabio Traversi, Emiliano Belotti, Pietro et al.

Source: Mathematical Programming Computation ; https://hal.science/hal-02177672 ; Mathematical Programming Computation, 2019, 11 (2), ⟨10.1007/s12532-018-0147-4⟩

Subject Terms: Binary quadratic programming, Mixed-Integer Quadratically Constrained Quadratic Programming, Quadratic programming, Instance library, [INFO]Computer Science [cs]

Availability: https://hal.science/hal-02177672
https://hal.science/hal-02177672v1/document
https://hal.science/hal-02177672v1/file/5846.pdf
https://doi.org/10.1007/s12532-018-0147-4