Essentials of numerical nonsmooth optimization (Q5918756)

scientific article; zbMATH DE number 7565587

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

Statements

instance of

scholarly article

0 references

title

Essentials of numerical nonsmooth optimization (English)

0 references

author

Manlio Gaudioso

0 references

Giovanni Giallombardo

0 references

Giovanna Miglionico

0 references

published in

Annals of Operations Research

0 references

publication date

1 August 2022

0 references

zbMATH Keywords

nonsmooth optimization

0 references

cutting plane

0 references

subgradient method

0 references

bundle method

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-021-04498-y

0 references

cites work

A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

Minimization of functions having Lipschitz continuous first partial derivatives

0 references

Piecewise-quadratic Approximations in Convex Numerical Optimization

0 references

A method for convex minimization based on translated first-order approximations

0 references

Optimizing sensor cover energy via DC programming

0 references

Numerical Nonsmooth Optimization

0 references

Discrete gradient method: Derivative-free method for nonsmooth optimization

0 references

Introduction to Nonsmooth Optimization

0 references

The volume algorithm revisited: relation with bundle methods

0 references

The volume algorithm: Producing primal solutions with a subgradient method

0 references

Two-Point Step Size Gradient Methods

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

Lectures on Modern Convex Optimization

0 references

Q4209222

0 references

Q3102800

0 references

A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals

0 references

Solving convex programs by random walks

0 references

A family of variable metric proximal methods

0 references

A descent proximal level bundle method for convex nondifferentiable optimization

0 references

A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

0 references

The Speed of Shor's R-algorithm

0 references

Representations of quasi-Newton matrices and their use in limited memory methods

0 references

Newton's method for convex programming and Tschebyscheff approximation

0 references

Proximal quasi-Newton methods for nondifferentiable convex optimization

0 references

Optimization and nonsmooth analysis

0 references

Convergence Analysis of Deflected Conditional Approximate Subgradient Methods

0 references

A polynomial Newton method for linear programming

0 references

Proximal bundle methods for nonsmooth DC programming

0 references

The ABC of DC programming

0 references

Convex proximal bundle methods in depth: a unified analysis for inexact oracles

0 references

A doubly stabilized bundle method for nonsmooth convex optimization

0 references

Minmaxmin problems revisited

0 references

A bundle modification strategy for convex minimization

0 references

Q4875353

0 references

A smooth method for the finite minimax problem

0 references

Smooth transformation of the generalized minimax problem

0 references

A central cutting plane algorithm for the convex programming problem

0 references

Q5538312

0 references

A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization

0 references

Q5821624

0 references

Solving semidefinite quadratic problems within nonsmooth optimization algorithms

0 references

Generalized Bundle Methods

0 references

Dynamic smoothness parameter for fast gradient methods

0 references

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control

0 references

A partially inexact bundle method for convex semi-infinite minmax problems

0 references

A descent algorithm for nonsmooth convex optimization

0 references

A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization

0 references

An Incremental Method for Solving Convex Finite Min-Max Problems

0 references

On solving the Lagrangian dual of integer programs via an incremental approach

0 references

Minimizing Piecewise-Concave Functions Over Polyhedra

0 references

Essentials of numerical nonsmooth optimization

0 references

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

0 references

Classification in the multiple instance learning framework via spherical separation

0 references

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization

0 references

Gradient set splitting in nonconvex nonsmooth numerical optimization

0 references

Feature selection in SVM via polyhedral \(k\)-norm

0 references

A bundle type approach to the unconstrained minimization of convex nonsmooth functions

0 references

Quadratic Approximations in Convex Nondifferentiable Optimization

0 references

Variants to the cutting plane approach for convex nondifferentiable optimization

0 references

On convergence rates of subgradient optimization methods

0 references

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

0 references

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

0 references

A class on nonmonotone stabilization methods in unconstrained optimization

0 references

Globally convergent limited memory bundle method for large-scale nonsmooth optimization

0 references

Combined lp and quasi-Newton methods for minimax optimization

0 references

A Redistributed Proximal Bundle Method for Nonconvex Optimization

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

A proximal bundle method based on approximate subgradients

0 references

Q3141900

0 references

Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming

0 references

Diagonal bundle method for nonsmooth sparse optimization

0 references

The Cutting-Plane Method for Solving Convex Programs

0 references

An aggregate subgradient method for nonsmooth convex minimization

0 references

Methods of descent for nondifferentiable optimization

0 references

A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization

0 references

Proximity control in bundle methods for convex nondifferentiable minimization

0 references

A Cholesky dual method for proximal piecewise linear programming

0 references

Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization

0 references

A bundle Bregman proximal method for convex nondifferentiable minimization

0 references

Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

0 references

A Proximal Bundle Method with Approximate Subgradient Linearizations

0 references

Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

0 references

A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

0 references

0 references

0 references

0 references

0 references

0 references

0 references

New variants of bundle methods

0 references

Variable metric bundle methods: From conceptual to implementable forms

0 references

Q3316093

0 references

Q5576518

0 references

A bundle-Newton method for nonsmooth unconstrained minimization

0 references

Survey of Bundle Methods for Nonsmooth Optimization

0 references

Q4004158

0 references

A science fiction story in nonsmooth optimization originating at IIASA

0 references

A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization

0 references

Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization

0 references

A quasi-second-order proximal bundle algorithm

0 references

A \(\mathcal{VU}\)-algorithm for convex minimization

0 references

Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization

0 references

Proximité et dualité dans un espace hilbertien

0 references

Incremental Subgradient Methods for Nondifferentiable Optimization

0 references

Q3967358

0 references

Complexity estimates of some cutting plane methods based on the analytic barrier

0 references

Smooth minimization of non-smooth functions

0 references

Primal-dual subgradient methods for convex problems

0 references

Universal gradient methods for convex optimization problems

0 references

Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods

0 references

Q4744875

0 references

A proximal cutting plane method using Chebychev center for nonsmooth convex optimization

0 references

Superlinearly convergent algorithm for min-max problems

0 references

0 references

0 references

0 references

0 references

A nonsmooth version of Newton's method

0 references

A trust region algorithm for minimization of locally Lipschitzian functions

0 references

Globally convergent BFGS method for nonsmooth convex optimization

0 references

Q4235027

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results

0 references

Q5187067

0 references

Nondifferentiable optimization and polynomial problems

0 references

Global optimality conditions for nonconvex optimization

0 references

The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm

0 references

Convex analysis and global optimization

0 references

Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems

0 references

Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

0 references

Q4146571

0 references

Finding the nearest point in A polytope

0 references

Identifiers

zbMATH Open document ID

1496.90094

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10479-021-04498-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5918756