Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
From MaRDI portal
Recommendations
- A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization
- scientific article; zbMATH DE number 1437399
- A generalized projection of strongly sub-feasible direction method with strong convergence for nonlinear constrained optimization
- A strongly convergent method of quasi-strongly sub-feasible directions for constrained optimization
- Publication:3477899
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A bundle-filter method for nonsmooth convex constrained optimization
- A computational comparison of some non-linear programs
- A computationally efficient feasible sequential quadratic programming algorithm
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An active set method for solving linearly constrained nonsmooth optimization problems
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Combined phase I—phase II methods of feasible directions
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Monotone Operators and the Proximal Point Algorithm
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Newton's method for convex programming and Tschebyscheff approximation
- Nonlinear programming without a penalty function.
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Survey of Bundle Methods for Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(14)- scientific article; zbMATH DE number 4147420 (Why is no real title available?)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- scientific article; zbMATH DE number 1383164 (Why is no real title available?)
- A proximal-projection partial bundle method for convex constrained minimax problems
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- scientific article; zbMATH DE number 169245 (Why is no real title available?)
- scientific article; zbMATH DE number 1437399 (Why is no real title available?)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization
- A two-phase bundle method with bundle modification for nonsmooth constrained optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
This page was built for publication: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439450)
