scientific article; zbMATH DE number 3846333
From MaRDI portal
Publication:3316093
Recommendations
- An implementable bundle method for nonsmooth convex optimization
- scientific article; zbMATH DE number 16626
- Bundle method for nonconvex nonsmooth constrained optimization
- scientific article; zbMATH DE number 778137
- Survey of Bundle Methods for Nonsmooth Optimization
- A hybrid bundle method for nonsmooth convex optimization
- scientific article; zbMATH DE number 4119953
- Subgradient and bundle methods for nonsmooth optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- An approximate bundle method for non-convex optimization and its dual problem
Cited in
(only showing first 100 items - show all)- An inexact proximal point method for solving generalized fractional programs
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- Optimization with nonsmooth data
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Sublinear upper bounds for stochastic programs with recourse
- Bundle-based decomposition: Conditions for convergence
- Complementary finite-element method for finite deformation nonsmooth mechanics
- New types of variational principles based on the notion of quasidifferentiability
- Direct approach to the minimization of the maximal stress over an arch structure
- A bundle-Newton method for nonsmooth unconstrained minimization
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Convergence of some algorithms for convex minimization
- Load balancing in the parallel optimization of block-angular linear programs
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Variable metric bundle methods: From conceptual to implementable forms
- Maximal closure on a graph with resource constraints
- Partitioning mathematical programs for parallel solution
- Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities.
- New diagonal bundle method for clustering problems in large data sets
- Non-Euclidean restricted memory level method for large-scale convex 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
- Scenario analysis via bundle decomposition
- Optimal prestress of structures with frictional unilateral contact interfaces
- Generalized proximal point algorithm for convex optimization
- New variants of bundle methods
- Generalized derivatives of eigenvalues of a symmetric matrix
- Derivative-free optimization via proximal point methods
- A simple version of bundle method with linear programming
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- A bundle-type algorithm for routing in telecommunication data networks
- Lexicographic derivatives of nonsmooth glucose-insulin kinetics under normal and artificial pancreatic responses
- scientific article; zbMATH DE number 1584097 (Why is no real title available?)
- An approximate bundle method for non-convex optimization and its dual problem
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- On the numerical solution of a class of Stackelberg problems
- Nonsmooth DAEs with applications in modeling phase changes
- A descent algorithm for nonsmooth convex optimization
- scientific article; zbMATH DE number 4160493 (Why is no real title available?)
- Algorithm for nonsmooth optimization
- OPtimum design for potential flows
- scientific article; zbMATH DE number 3948007 (Why is no real title available?)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- Solving generation expansion planning problems with environmental constraints by a bundle method
- A regularized decomposition method for minimizing a sum of polyhedral functions
- An active set method for solving linearly constrained nonsmooth optimization problems
- scientific article; zbMATH DE number 4061013 (Why is no real title available?)
- scientific article; zbMATH DE number 4105704 (Why is no real title available?)
- scientific article; zbMATH DE number 16626 (Why is no real title available?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- scientific article; zbMATH DE number 123281 (Why is no real title available?)
- scientific article; zbMATH DE number 4123184 (Why is no real title available?)
- scientific article; zbMATH DE number 1092213 (Why is no real title available?)
- scientific article; zbMATH DE number 1918608 (Why is no real title available?)
- scientific article; zbMATH DE number 1748524 (Why is no real title available?)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- Generalized sensitivity analysis of nonlinear programs
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides
- scientific article; zbMATH DE number 864910 (Why is no real title available?)
- Diagonal bundle method for nonsmooth sparse optimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- A \(\mathcal{VU}\)-point of view of nonsmooth optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Differentiable McCormick relaxations
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- A modified affine scaling methodology for nonsmooth optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
- On a class of nonsmooth optimal control 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
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Essentials of numerical nonsmooth optimization
- 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
- Cutting plane oracles to minimize non-smooth non-convex functions
- Generalized derivatives of optimal-value functions with parameterized convex programs embedded
- Constructing a subgradient from directional derivatives for functions of two variables
- Stabilized Benders decomposition for energy planning under climate uncertainty
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
- Generalized derivatives of nonsmooth discrete-time systems
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
- Generalized derivatives of differential-algebraic equations
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- The interior proximal extragradient method for solving equilibrium problems
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition
- Computing proximal points of nonconvex functions
- A bundle method for solving equilibrium problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316093)
