A constraint linearization method for nondifferentiable convex minimization
From MaRDI portal
Recommendations
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- scientific article; zbMATH DE number 3972657
- scientific article; zbMATH DE number 3878691
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
Cites work
- scientific article; zbMATH DE number 3874967 (Why is no real title available?)
- scientific article; zbMATH DE number 3916028 (Why is no real title available?)
- scientific article; zbMATH DE number 3979878 (Why is no real title available?)
- scientific article; zbMATH DE number 3750660 (Why is no real title available?)
- scientific article; zbMATH DE number 3804766 (Why is no real title available?)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Equivalence of some quadratic programming algorithms
- Methods of descent for nondifferentiable optimization
- Numerical methods for nondifferentiable convex optimization
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Some remarks on the construction of higher order algorithms in convex optimization
- Sufficiency of Exact Penalty Minimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(28)- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Survey of Bundle Methods for Nonsmooth Optimization
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- scientific article; zbMATH DE number 4162666 (Why is no real title available?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- A bundle-filter method for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 3876932 (Why is no real title available?)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- An algorithm for calculating one subgradient of a convex function of two variables
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- scientific article; zbMATH DE number 3878691 (Why is no real title available?)
- A variable metric method for nonsmooth convex constrained optimization
- A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems
- A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION
- A filter-variable-metric method for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 3918115 (Why is no real title available?)
- scientific article; zbMATH DE number 4062841 (Why is no real title available?)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- An active set method for solving linearly constrained nonsmooth optimization problems
- An inexact bundle variant suited to column generation
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Extension of unconstrained minimization methods to linearly constrained problems
- Solution of general linear complementarity problems via nondifferentiable concave minimization
This page was built for publication: A constraint linearization method for nondifferentiable convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099787)
