A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10255-018-0755-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800646568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level bundle methods for oracles with on-demand accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle modification strategy for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of truncated codifferential with application to some problems of cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuning strategy for the proximity parameter in convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible descent bundle method for inequality constrained Minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle-filter method for nonsmooth convex constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Formulations for Training Multilayer Perceptrons / 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: Methods of descent for nondifferentiable optimization / 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: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric bundle methods: From conceptual to implementable forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex proximal bundle methods in depth: a unified analysis for inexact oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem / 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: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank

Latest revision as of 18:09, 15 July 2024

scientific article
Language Label Description Also known as
English
A feasible point method with bundle modification for nonsmooth convex constrained optimization
scientific article

    Statements

    A feasible point method with bundle modification for nonsmooth convex constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    0 references
    nonsmooth optimization
    0 references
    feasible point method
    0 references
    bundle modification
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references