scientific article; zbMATH DE number 3880447
From MaRDI portal
Publication:3346095
Recommendations
Cites work
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Finding the nearest point in A polytope
- scientific article; zbMATH DE number 3874969 (Why is no real title available?)
- scientific article; zbMATH DE number 4007605 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- Linearly constrained minimax optimization
- Variable metric methods for linearly constrained nonlinear minimax approximation
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(19)- A bundle-Newton method for nonsmooth unconstrained minimization
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Clusterwise support vector linear regression
- An augmented subgradient method for minimizing nonsmooth DC functions
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Subgradient and bundle methods for nonsmooth optimization
- scientific article; zbMATH DE number 3874969 (Why is no real title available?)
- scientific article; zbMATH DE number 4152168 (Why is no real title available?)
- scientific article; zbMATH DE number 3902406 (Why is no real title available?)
- scientific article; zbMATH DE number 3956831 (Why is no real title available?)
- scientific article; zbMATH DE number 4007605 (Why is no real title available?)
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Diagonal bundle method for nonsmooth sparse optimization
- Convergence of a dual algorithm for minimax problems
- A Lagrangean dual-based solution method for a special linear programming problem
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Primal-dual method of solving convex quadratic programming problems
- A bundle-filter method for nonsmooth convex constrained optimization
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 Q3346095)