A method of linearizations for linearly constrained nonconvex nonsmooth minimization
From MaRDI portal
Recommendations
- A Linearization Algorithm for Nonsmooth Minimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- scientific article; zbMATH DE number 4045492
- scientific article; zbMATH DE number 3916028
- A constraint linearization method for nondifferentiable convex minimization
Cites work
- A Linearization Algorithm for Nonsmooth Minimization
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An aggregate subgradient method for nonsmooth convex minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Convex Analysis
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3878691 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- Linearly constrained minimax optimization
- Methods of descent for nondifferentiable optimization
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization and nonsmooth analysis
- Optimization of upper semidifferentiable functions
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(33)- A subgradient selection method for minimizing convex functions subject to linear constraints
- A constraint linearization method for nondifferentiable convex minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- A direct method of linearization for continuous minimax problems
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- A derivative-free method for linearly constrained nonsmooth optimization
- A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Linearly constrained nonsmooth and nonconvex minimization
- A proximal alternating linearization method for nonconvex optimization problems
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Extension of unconstrained minimization methods to linearly constrained problems
- scientific article; zbMATH DE number 3874967 (Why is no real title available?)
- scientific article; zbMATH DE number 3876932 (Why is no real title available?)
- scientific article; zbMATH DE number 4204123 (Why is no real title available?)
- scientific article; zbMATH DE number 4162666 (Why is no real title available?)
- A Linearization Algorithm for Nonsmooth Minimization
- scientific article; zbMATH DE number 3916028 (Why is no real title available?)
- scientific article; zbMATH DE number 3932811 (Why is no real title available?)
- A successive quadratic programming algorithm with global and superlinear convergence properties
- scientific article; zbMATH DE number 4045492 (Why is no real title available?)
- scientific article; zbMATH DE number 16326 (Why is no real title available?)
- scientific article; zbMATH DE number 736944 (Why is no real title available?)
- Survey of Bundle Methods for Nonsmooth Optimization
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- Minimization of nonlinear functions with linear constraints
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Linear-programming approach to nonconvex variational problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- The linearized version of an algorithm for the mixed norms problem
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities
This page was built for publication: A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730358)
