An Algorithm for Constrained Optimization with Semismooth Functions

Cited in

(84)

Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
A subgradient algorithm for certain minimax and minisum problems
A subgradient selection method for minimizing convex functions subject to linear constraints
Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
Survey of Bundle Methods for Nonsmooth Optimization
Nonsmooth optimization via quasi-Newton methods
Descent methods for composite nondifferentiable optimization problems
A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
Optimal Convergence Rates for the Proximal Bundle Method
Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
A method for minimizing the sum of a convex function and a continuously differentiable function
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
Line search algorithms for locally Lipschitz functions on Riemannian manifolds
A minimization method for the sum of a convex function and a continuously differentiable function
A bundle-filter method for nonsmooth convex constrained optimization
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
On parametric nonlinear programming
Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
Links between functions and subdifferentials
Double bundle method for finding Clarke stationary points in nonsmooth DC programming
On a class of nonsmooth optimal control problems
Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
An inexact bundle method and subgradient computations for optimal control of deterministic and stochastic obstacle problems
A gradient sampling algorithm for stratified maps with applications to topological data analysis
Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
A constraint linearization method for nondifferentiable convex minimization
A regularized stochastic decomposition algorithm for two-stage stochastic linear programs
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
Approximating Clarke's subgradients of semismooth functions by divided differences
Energy space Newton differentiability for solution maps of unilateral and bilateral obstacle problems
A maximization method for a class of quasiconcave programs
Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
Generalized gradients in dynamic optimization, optimal control, and machine learning problems
Extended semismooth Newton method for functions with values in a cone
An effective nonsmooth optimization algorithm for locally Lipschitz functions
Discrete minimax problem: Algorithms and numerical comparisons
A nonsmooth version of Newton's method
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
The maximal normal operator space and integration of subdifferentials of nonconvex functions
Application of the successive relaxation method to solve extremal problems with semismooth functions
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
Convergence and computational analyses for some variable target value and subgradient deflection methods
Descent algorithm for a class of convex nondifferentiable functions
A hierarchy of spectral relaxations for polynomial optimization
Smooth transformation of the generalized minimax problem
Approximate discrete maximum principle for the difference approximation of optimal periodic control problems
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
Weak directional closedness and generalized subdifferentials
A variable metric method for nonsmooth convex constrained optimization
An aggregate subgradient method for nonsmooth convex minimization
An algorithm for minimizing a class of locally Lipschitz functions
Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
Piecewise linear approximations in nonconvex nonsmooth optimization
A method for convex minimization based on translated first-order approximations
Algorithms and application for special classes of nonlinear least squares problems
Optimistic planning algorithms for state-constrained optimal control problems
A descent algorithm for nonsmooth convex optimization
Discrete gradient method: Derivative-free method for nonsmooth optimization
Generalized gradients and paths of descent
Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control
An efficient algorithm for solving the discrete minisum problem
Convergence of relaxation methods for nondifferentiable constrained optimization
A note on the convergence of deterministic gradient sampling in nonsmooth optimization
A filter-variable-metric method for nonsmooth convex constrained optimization
Nonmonotone bundle-type scheme for convex nonsmooth minimization
Dynamic contact of a beam-rod system with Signorini typed contact conditions and thermal effects
Optimization of upper semidifferentiable functions
A generalized proximal point algorithm for certain non-convex minimization problems
A smooth method for the finite minimax problem
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
ε-Optimal solutions in nondifferentiable convex programming and some related questions
Analysis of symmetric matrix valued functions. I
An inexact bundle variant suited to column generation
scientific article; zbMATH DE number 6027005 (Why is no real title available?)
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
The bundle scheme for solving arbitrary eigenvalue optimizations
Semismoothness and decomposition of maximal normal operators
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
An adaptive competitive penalty method for nonsmooth constrained optimization

This page was built for publication: An Algorithm for Constrained Optimization with Semismooth Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178793)