Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
From MaRDI portal
Recommendations
- Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Proximal-gradient algorithms for fractional programming
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Prox-dual regularization algorithm for generalized fractional programs
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3979878 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 7009350 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A descent algorithm for nonsmooth convex optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A new algorithm for generalized fractional programs
- A note on an algorithm for generalized fractional programs
- A proximal point algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- An Algorithm for Constrained Optimization with Semismooth Functions
- An aggregate subgradient method for nonsmooth convex minimization
- An algorithm for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Convergence of interval-type algorithms for generalized fractional programming
- Convergence of some algorithms for convex minimization
- Dual method of centers for solving generalized fractional programs
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- Fractional Programming
- Generalized fractional programming duality: A parametric approach
- Maximization of Signal-to-Noise Ratio in an Optical Filter
- Method of centers for generalized fractional programming
- Methods of descent for nondifferentiable optimization
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- On Nonlinear Fractional Programming
- On general minimax theorems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- Programmation mathématique convexe
- Prox-dual regularization algorithm for generalized fractional programs
- Prox-regularization methods for generalized fractional programming
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Proximité et dualité dans un espace hilbertien
- Some properties of methods of centers
- Survey of Bundle Methods for Nonsmooth Optimization
- Using duality to solve generalized fractional programming problems
- Weak Sharp Minima in Mathematical Programming
Cited in
(16)- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- An inexact proximal point method for solving generalized fractional programs
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Global algorithm for effectively solving min-max affine fractional programs
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
- A proximal-projection partial bundle method for convex constrained minimax problems
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Successive upper approximation methods for generalized fractional programs
- A proximal point algorithm for generalized fractional programs
- Proximal-gradient algorithms for fractional programming
This page was built for publication: Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730809)
