Regularized optimization methods for convex MINLP problems (Q518454): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Welington de Oliveira / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52A39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6697781 / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed-integer programming
Property / zbMATH Keywords: mixed-integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
cutting-plane method
Property / zbMATH Keywords: cutting-plane method / rank
 
Normal rank
Property / zbMATH Keywords
 
nonsmooth optimization
Property / zbMATH Keywords: nonsmooth optimization / rank
 
Normal rank
Property / author
 
Property / author: Welington de Oliveira / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OPTI / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bonmin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AlphaECP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2293133283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5402621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of explicit stabilizing terms in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interval-subgradient and no-good cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A doubly stabilized bundle method for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalization of ECP and OA methods to nonsmooth convex MINLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of nonlinear mixed-integer and disjunctive programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact bundle variant suited to column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parallelizing dual decomposition in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the primal-dual interior point algorithm within the branch-price-and-cut method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide to conquer: decomposition methods for energy optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain design under uncertainty using sample average approximation and dual decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic constrained optimization. Methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level bundle methods for constrained convex optimization with various oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the subdifferential of singular Gaussian distribution functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Regularized optimization methods for convex MINLP problems
scientific article

    Statements

    Regularized optimization methods for convex MINLP problems (English)
    0 references
    0 references
    28 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed-integer programming
    0 references
    cutting-plane method
    0 references
    nonsmooth optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references