scientific article

Jean Jacques Strodiot, A. Bihain, Claude Lemaréchal

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

convergence nonsmooth optimization active set strategy bundle algorithm

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items (74)

An aggregate subgradient method for nonsmooth and nonconvex minimization ⋮ Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs ⋮ The interior proximal extragradient method for solving equilibrium problems ⋮ Unnamed Item ⋮ Optimization with nonsmooth data ⋮ Scenario analysis via bundle decomposition ⋮ A class of convergent primal-dual subgradient algorithms for decomposable convex programs ⋮ Variable metric bundle methods: From conceptual to implementable forms ⋮ Generalized derivatives of eigenvalues of a symmetric matrix ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ Optimal prestress of structures with frictional unilateral contact interfaces ⋮ A regularized decomposition method for minimizing a sum of polyhedral functions ⋮ Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ Generalized proximal point algorithm for convex optimization ⋮ Maximal closure on a graph with resource constraints ⋮ Sublinear upper bounds for stochastic programs with recourse ⋮ A bundle-type algorithm for routing in telecommunication data networks ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ On the numerical solution of a class of Stackelberg problems ⋮ Bundle-based decomposition: Conditions for convergence ⋮ Lexicographic derivatives of nonsmooth glucose-insulin kinetics under normal and artificial pancreatic responses ⋮ Partitioning mathematical programs for parallel solution ⋮ New variants of bundle methods ⋮ An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition ⋮ Complementary finite-element method for finite deformation nonsmooth mechanics ⋮ Cutting plane oracles to minimize non-smooth non-convex functions ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Analyzing the Influence of Agents in Trust Networks: Applying Nonsmooth Eigensensitivity Theory to a Graph Centrality Problem ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches ⋮ Generalized Sensitivity Analysis of Nonlinear Programs ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ An active set method for solving linearly constrained nonsmooth optimization problems ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Nonsmooth DAEs with Applications in Modeling Phase Changes ⋮ Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides ⋮ Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ New types of variational principles based on the notion of quasidifferentiability ⋮ Differentiable McCormick relaxations ⋮ Derivative-free optimization via proximal point methods ⋮ Computing proximal points of nonconvex functions ⋮ A bundle method for solving equilibrium problems ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ A descent algorithm for nonsmooth convex optimization ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ Non-Euclidean restricted memory level method for large-scale convex optimization ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ On a class of nonsmooth optimal control problems ⋮ Unnamed Item ⋮ Generalized derivatives of differential-algebraic equations ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Essentials of numerical nonsmooth optimization ⋮ Some experiments on heuristic code selection versus numerical performance in nonlinear programming ⋮ A numerical approach to optimization problems with variational inequality constraints ⋮ Iterative bundle-based decomposition for large-scale nonseparable convex optimization ⋮ Direct approach to the minimization of the maximal stress over an arch structure ⋮ Parallel bundle-based decomposition for large-scale structured mathematical programming problems ⋮ An inexact proximal point method for solving generalized fractional programs ⋮ Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints ⋮ Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities. ⋮ Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization ⋮ An algorithm for linearly constrained convex nondifferentiable minimization problems ⋮ A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Unnamed Item ⋮ OPtimum design for potential flows ⋮ Convergence of some algorithms for convex minimization ⋮ Load balancing in the parallel optimization of block-angular linear programs

This page was built for publication: