90C30 Nonlinear programming
Refine
Year of publication
Document Type
- ZIB-Report (23)
Has Fulltext
- yes (23)
Is part of the Bibliography
- no (23)
Keywords
- Branch-and-cut (2)
- Branch-and-price (2)
- Column generation (2)
- Constraint integer programming (2)
- Large Neighborhood Search (2)
- Linear programming (2)
- MIQCP (2)
- Mixed-Integer Nonlinear Programming (2)
- Mixed-integer linear programming (2)
- Mixed-integer nonlinear programming (2)
- Mixed-integer semidefinite programming (2)
- Optimization solver (2)
- Parallelization (2)
- Primal Heuristic (2)
- mixed-integer quadratically constrained programming (2)
- nonconvex (2)
- operative planning (2)
- Chemical Processes (1)
- Drinking water supply (1)
- Entry-Exit Model (1)
- Gas Distribution Networks (1)
- Gas Market Liberalization (1)
- Gas Network Access Regulation (1)
- Gas network (1)
- Gas networks (1)
- Intersection cuts (1)
- KKT system factorization (1)
- LP solver (1)
- MINLP (1)
- MINLP solver (1)
- MIP (1)
- MIP solver (1)
- Mathematical Optimization (1)
- Mengenüberdeckung (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Nonlinear Nonconvex Stochastic Optimization (1)
- Mixed-Intger Programming (1)
- Multistage Stochastic Programs (1)
- Nachbarschaftssuche (1)
- Nonconvex Optimization (1)
- PDE constrained optimization (1)
- Primalheuristik (1)
- Probabilistic Constraints (1)
- Pseudo-Boolean (1)
- QCQPs (1)
- Quadratic-free sets (1)
- Steiner tree solver (1)
- Topology Planning (1)
- Trinkwasserversorgung (1)
- Uncertainty (1)
- Water supply (1)
- branch-and-cut (1)
- branch-cut-and-price framework (1)
- computational (1)
- constraint integer programming (1)
- continuous time model (1)
- convergence enhancement (1)
- discrete decisions (1)
- diskrete Entscheidungen (1)
- distribution network (1)
- domain propagation (1)
- generic column generation (1)
- global optimization (1)
- integer programming (1)
- kostenminimale Betriebsplanung (1)
- large neighborhood search (1)
- large-scale nonlinear programming (1)
- large-scale optimization (1)
- linear programming (1)
- linear relaxation (1)
- minimum cost operative planning (1)
- mixed integer model (1)
- mixed-integer linear and nonlinear programming (1)
- mixed-integer nonlinear programming (1)
- mixed-integer programming (1)
- mixed-integer semidefinite programming (1)
- modeling (1)
- multi-criteria optimization (1)
- network reduction (1)
- nichtlineare Optimierung (1)
- nonlinear programming (1)
- nonlinear programming m (1)
- parallel branch-and-bound (1)
- perspective cuts, mixed-integer nonlinear programming, nonconvex optimization, computational study (1)
- primal heuristic (1)
- quadratic programming (1)
- separation algorithm (1)
- set covering (1)
- simplex method (1)
- sparse projection method (1)
- vehicle positioning (1)
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 8.0 of the SCIP Optimization Suite. Major updates in SCIP include improvements in symmetry handling and decomposition algorithms, new cutting planes, a new plugin type for cut selection, and a complete rework of the way nonlinear constraints are handled. Additionally, SCIP 8.0 now supports interfaces for Julia as well as Matlab. Further, UG now includes a unified framework to parallelize all solvers, a utility to analyze computational experiments has been added to GCG, dual solutions can be postsolved by PaPILO, new heuristics and presolving methods were added to SCIP-SDP, and additional problem classes and major performance improvements are available in SCIP-Jack.
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials certificates, which are well suited for sparse problems since the computational cost depends only on the number of terms in the polynomials and does not depend on the degrees of the polynomials. This work is a first step to integrating SONC-based relaxations of polynomial problems into a branch-and-bound algorithm. To this end, the SONC relaxation for constrained optimization problems is extended in order to better utilize variable bounds, since this property is key for the success of a relaxation in the context of branch-and-bound. Computational experiments show that the proposed extension is crucial for making the SONC relaxations applicable to most constrained polynomial optimization problems and for integrating the two approaches.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming framework SCIP. This report discusses the enhancements and extensions included in the SCIP Optimization Suite 9.0. The updates in SCIP 9.0 include improved symmetry handling, additions and improvements of nonlinear handlers and primal heuristics, a new cut generator and two new cut selection schemes, a new branching rule, a new LP interface, and several bug fixes. The SCIP Optimization Suite 9.0 also features new Rust and C++ interfaces for SCIP, new Python interface for SoPlex, along with enhancements to existing interfaces. The SCIP Optimization Suite 9.0 also includes new and improved features in the LP solver SoPlex, the presolving library PaPILO, the parallel framework UG, the decomposition framework GCG, and the SCIP extension SCIP-SDP. These additions and enhancements have resulted in an overall performance improvement of SCIP in terms of solving time, number of nodes in the branch-and-bound tree, as well as the reliability of the solver.