Essentials of numerical nonsmooth optimization (Q5970841): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1007/s10288-019-00425-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2993689585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing sensor cover energy via DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise-quadratic Approximations in Convex Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for convex minimization based on translated first-order approximations / 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: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm revisited: relation with bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / 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: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102800 / 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: Solving convex programs by random walks / 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: A descent proximal level bundle method for convex nondifferentiable 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: The Speed of Shor's R-algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / 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: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Deflected Conditional Approximate Subgradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal bundle methods for nonsmooth DC programming / 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: Convex proximal bundle methods in depth: a unified analysis for inexact oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmaxmin problems revisited / 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 smooth method for the finite minimax problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth transformation of the generalized minimax problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic smoothness parameter for fast gradient 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 partially inexact bundle method for convex semi-infinite minmax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent algorithm for nonsmooth 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: Gradient set splitting in nonconvex nonsmooth numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle type approach to the unconstrained minimization of convex nonsmooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Approximations in Convex Nondifferentiable Optimization / 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: An Incremental Method for Solving Convex Finite Min-Max Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving the Lagrangian dual of integer programs via an incremental approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Piecewise-Concave Functions Over Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical infinitesimals in a variable metric method for convex nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification in the multiple instance learning framework via spherical separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates of subgradient optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class on nonmonotone stabilization methods in unconstrained optimization / 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: Combined lp and quasi-Newton methods for minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method based on approximate subgradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal bundle method for nonsmooth sparse optimization / 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 aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth 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: A Cholesky dual method for proximal piecewise linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle Bregman proximal method for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization / 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: Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172009 / 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: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576518 / 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: Survey of Bundle Methods for Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization / 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: A \(\mathcal{VU}\)-algorithm for convex minimization / 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: A science fiction story in nonsmooth optimization originating at IIASA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximité et dualité dans un espace hilbertien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Subgradient Methods for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates of some cutting plane methods based on the analytic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent algorithm for min-max problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3863445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region algorithm for minimization of locally Lipschitzian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent BFGS method for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / 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: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization and polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global 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: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Latest revision as of 11:11, 22 July 2024

scientific article; zbMATH DE number 7190850
Language Label Description Also known as
English
Essentials of numerical nonsmooth optimization
scientific article; zbMATH DE number 7190850

    Statements

    Essentials of numerical nonsmooth optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    0 references
    nonsmooth optimization
    0 references
    cutting plane
    0 references
    subgradient method
    0 references
    bundle method
    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
    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
    0 references
    0 references