Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-015-0034-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise linear approximations in nonconvex nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferential optimization via adaptive smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous subdifferential approximations and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization / 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: Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of variable metric proximal methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal quasi-Newton methods for nondifferentiable convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing proximal points of nonconvex functions / 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: A quasi-second-order proximal bundle algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle-Newton method for nonsmooth unconstrained 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: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of lipschitz continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective nonsmooth optimization algorithm for locally Lipschitz functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient line search for nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Point of a Polyhedron Closest to the Origin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-015-0034-2 / rank
 
Normal rank

Latest revision as of 13:28, 9 December 2024

scientific article
Language Label Description Also known as
English
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
scientific article

    Statements

    Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (English)
    0 references
    18 May 2016
    0 references
    nonconvex nonsmooth optimization
    0 references
    nonsmooth line search method
    0 references
    nonsmooth BFGS method
    0 references
    Lipschitz functions
    0 references
    Wolfe conditions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers