Pages that link to "Item:Q1266608"
From MaRDI portal
The following pages link to Conditional subgradient optimization -- theory and applications (Q1266608):
Displaying 39 items.
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization (Q421765) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- A subgradient method for solving multiproduct network development problems with survivability guarantees (Q1323948) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods (Q1819151) (← links)
- A primal-dual subgradient method for time staged capacity expansion planning (Q1820669) (← links)
- Accelerating the convergence of subgradient optimisation (Q1847153) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- Management of wind power variations in electricity system investment models. A parallel computing strategy (Q2033401) (← links)
- Convex optimization with an interpolation-based projection and its application to deep learning (Q2071365) (← links)
- Optimal design of differentiated credit charging links in mixed-autonomy transportation networks (Q2109642) (← links)
- A viscosity method with no spectral radius requirements for the split common fixed point problem (Q2256215) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Fixed point quasiconvex subgradient method (Q2282530) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm (Q2397581) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints (Q2845108) (← links)
- A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs (Q3798483) (← links)
- A dual scheme for traffic assignment problems (Q4375434) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- Method of conditional ?-subgradient for solving convex programming problems (Q4710661) (← links)
- Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
- Solving Basis Pursuit (Q5270711) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models (Q6588762) (← links)
