On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2012.712118 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088836601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Euclidean restricted memory level method for large-scale convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method to Solve the Minimax Problem Directly / 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: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants to the cutting plane approach for convex nondifferentiable optimization / 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: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent variable metric method for convex nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of Bundle Methods for Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank

Latest revision as of 21:03, 8 July 2024

scientific article; zbMATH DE number 6325362
Language Label Description Also known as
English
On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
scientific article; zbMATH DE number 6325362

    Statements

    On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    nonsmooth optimization
    0 references
    extended cutting plane algorithm
    0 references
    outer approximation algorithm
    0 references
    subgradient
    0 references
    0 references