Using regularization and second order information in outer approximation for convex MINLP
From MaRDI portal
(Redirected from Publication:2297649)
Recommendations
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Regularized optimization methods for convex MINLP problems
- An outer approximation method for a class of minimax convex MINLP problems
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
Cites work
- scientific article; zbMATH DE number 3002670 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A duality theorem for non-linear programming
- A feasibility pump for mixed integer nonlinear programs
- A logarithmic barrier cutting plane method for convex programming
- A tree-search algorithm for mixed integer programming problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Deterministic global optimization in nonlinear optimal control problems
- Generalized Benders decomposition
- Introduction to nonsmooth optimization. Theory, practice and software
- Introductory lectures on convex optimization. A basic course.
- Mixed-integer nonlinear optimization
- New variants of bundle methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Prices stabilization for inexact unit-commitment problems
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Reformulations for utilizing separability when solving convex MINLP problems
- Regularized optimization methods for convex MINLP problems
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- The Cutting-Plane Method for Solving Convex Programs
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Cited in
(13)- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A proximal-point outer approximation algorithm
- Sparse convex optimization toolkit: a mixed-integer framework
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- Partially distributed outer approximation
- An outer-approximation algorithm for maximum-entropy sampling
- Daily scheduling of generating units with natural-gas market constraints
- Outer approximation for mixed-integer nonlinear robust optimization
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Regularized optimization methods for convex MINLP problems
This page was built for publication: Using regularization and second order information in outer approximation for convex MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297649)
