scirs2-optimize 0.4.2

Optimization module for SciRS2 (scirs2-optimize)
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
//! Robust convergence criteria with multiple stopping conditions
//!
//! This module provides robust convergence detection that handles:
//! - Multiple simultaneous stopping criteria
//! - Early stopping for noisy or difficult functions
//! - Numerical stability considerations
//! - Progress-based convergence detection
//! - Time-based stopping conditions

use crate::error::OptimizeError;
use crate::unconstrained::adaptive_convergence::{
    AdaptiveToleranceOptions, AdaptiveToleranceState, ConvergenceStatus,
};
use scirs2_core::ndarray::ArrayView1;
use std::collections::VecDeque;
use std::time::{Duration, Instant};

/// Robust convergence options with multiple stopping criteria
#[derive(Debug, Clone)]
pub struct RobustConvergenceOptions {
    /// Adaptive tolerance options
    pub adaptive_tolerance: AdaptiveToleranceOptions,
    /// Enable early stopping for difficult problems
    pub enable_early_stopping: bool,
    /// Early stopping patience (iterations without improvement)
    pub early_stopping_patience: usize,
    /// Relative improvement threshold for early stopping
    pub early_stopping_min_delta: f64,
    /// Enable progress-based convergence
    pub enable_progress_based: bool,
    /// Number of iterations to consider for progress evaluation
    pub progress_window: usize,
    /// Minimum progress rate to continue optimization
    pub min_progress_rate: f64,
    /// Enable time-based stopping
    pub enable_time_limit: bool,
    /// Maximum optimization time
    pub max_time: Duration,
    /// Enable robust noisy function handling
    pub enable_noise_robust: bool,
    /// Window size for noise-robust convergence
    pub noise_window: usize,
    /// Confidence level for noise-robust convergence (0.0 to 1.0)
    pub noise_confidence: f64,
    /// Enable multiple criteria requirement
    pub require_multiple_criteria: bool,
    /// Number of criteria that must be satisfied simultaneously
    pub min_criteria_count: usize,
    /// Enable plateau detection
    pub enable_plateau_detection: bool,
    /// Plateau tolerance
    pub plateau_tolerance: f64,
    /// Plateau window size
    pub plateau_window: usize,
}

impl Default for RobustConvergenceOptions {
    fn default() -> Self {
        Self {
            adaptive_tolerance: AdaptiveToleranceOptions::default(),
            enable_early_stopping: true,
            early_stopping_patience: 20,
            early_stopping_min_delta: 1e-8,
            enable_progress_based: true,
            progress_window: 10,
            min_progress_rate: 1e-10,
            enable_time_limit: false,
            max_time: Duration::from_secs(3600), // 1 hour default
            enable_noise_robust: true,
            noise_window: 5,
            noise_confidence: 0.95,
            require_multiple_criteria: false,
            min_criteria_count: 2,
            enable_plateau_detection: true,
            plateau_tolerance: 1e-12,
            plateau_window: 15,
        }
    }
}

/// State for robust convergence detection
#[derive(Debug)]
pub struct RobustConvergenceState {
    /// Adaptive tolerance state
    adaptive_state: AdaptiveToleranceState,
    /// Early stopping state
    early_stop_state: EarlyStoppingState,
    /// Progress tracking state
    progress_state: ProgressState,
    /// Time tracking
    start_time: Option<Instant>,
    /// Noise robust state
    noise_state: NoiseRobustState,
    /// Plateau detection state
    plateau_state: PlateauState,
    /// Options
    options: RobustConvergenceOptions,
}

/// Early stopping state
#[derive(Debug, Clone)]
struct EarlyStoppingState {
    best_value: f64,
    iterations_without_improvement: usize,
    improvement_history: VecDeque<f64>,
}

/// Progress tracking state
#[derive(Debug, Clone)]
struct ProgressState {
    recent_values: VecDeque<f64>,
    recent_gradients: VecDeque<f64>,
    progress_rate: f64,
}

/// Noise-robust convergence state
#[derive(Debug, Clone)]
struct NoiseRobustState {
    function_window: VecDeque<f64>,
    gradient_window: VecDeque<f64>,
    step_window: VecDeque<f64>,
    #[allow(dead_code)]
    stable_convergence_count: usize,
}

/// Plateau detection state
#[derive(Debug, Clone)]
struct PlateauState {
    plateau_window: VecDeque<f64>,
    plateau_detected: bool,
    plateau_start_iteration: Option<usize>,
}

impl RobustConvergenceState {
    /// Create new robust convergence state
    pub fn new(options: RobustConvergenceOptions, problem_dim: usize) -> Self {
        let adaptive_state =
            AdaptiveToleranceState::new(options.adaptive_tolerance.clone(), problem_dim);

        Self {
            adaptive_state,
            early_stop_state: EarlyStoppingState {
                best_value: f64::INFINITY,
                iterations_without_improvement: 0,
                improvement_history: VecDeque::with_capacity(options.early_stopping_patience),
            },
            progress_state: ProgressState {
                recent_values: VecDeque::with_capacity(options.progress_window),
                recent_gradients: VecDeque::with_capacity(options.progress_window),
                progress_rate: 0.0,
            },
            start_time: Some(std::time::Instant::now()),
            noise_state: NoiseRobustState {
                function_window: VecDeque::with_capacity(options.noise_window),
                gradient_window: VecDeque::with_capacity(options.noise_window),
                step_window: VecDeque::with_capacity(options.noise_window),
                stable_convergence_count: 0,
            },
            plateau_state: PlateauState {
                plateau_window: VecDeque::with_capacity(options.plateau_window),
                plateau_detected: false,
                plateau_start_iteration: None,
            },
            options,
        }
    }

    /// Start timing for time-based convergence
    pub fn start_timing(&mut self) {
        if self.options.enable_time_limit {
            self.start_time = Some(Instant::now());
        }
    }

    /// Update state and check all convergence criteria
    pub fn update_and_check_convergence(
        &mut self,
        function_value: f64,
        gradient_norm: f64,
        step_norm: f64,
        iteration: usize,
        x: Option<&ArrayView1<f64>>,
    ) -> Result<RobustConvergenceResult, OptimizeError> {
        // Update adaptive tolerance state
        self.adaptive_state
            .update(function_value, gradient_norm, step_norm, iteration)?;

        // Update early stopping
        if self.options.enable_early_stopping {
            self.update_early_stopping(function_value, iteration);
        }

        // Update progress tracking
        if self.options.enable_progress_based {
            self.update_progress(function_value, gradient_norm);
        }

        // Update noise-robust state
        if self.options.enable_noise_robust {
            self.update_noise_robust(function_value, gradient_norm, step_norm);
        }

        // Update plateau detection
        if self.options.enable_plateau_detection {
            self.update_plateau_detection(function_value, iteration);
        }

        // Check all convergence criteria
        self.check_all_convergence_criteria(function_value, gradient_norm, step_norm, iteration)
    }

    /// Update early stopping state
    fn update_early_stopping(&mut self, function_value: f64, iteration: usize) {
        let improvement = self.early_stop_state.best_value - function_value;

        if improvement > self.options.early_stopping_min_delta {
            self.early_stop_state.best_value = function_value;
            self.early_stop_state.iterations_without_improvement = 0;
        } else {
            self.early_stop_state.iterations_without_improvement += 1;
        }

        // Track improvement history
        if self.early_stop_state.improvement_history.len() >= self.options.early_stopping_patience {
            self.early_stop_state.improvement_history.pop_front();
        }
        self.early_stop_state
            .improvement_history
            .push_back(improvement);
    }

    /// Update progress tracking
    fn update_progress(&mut self, function_value: f64, gradient_norm: f64) {
        // Add to recent values
        if self.progress_state.recent_values.len() >= self.options.progress_window {
            self.progress_state.recent_values.pop_front();
        }
        self.progress_state.recent_values.push_back(function_value);

        if self.progress_state.recent_gradients.len() >= self.options.progress_window {
            self.progress_state.recent_gradients.pop_front();
        }
        self.progress_state
            .recent_gradients
            .push_back(gradient_norm);

        // Calculate progress rate
        if self.progress_state.recent_values.len() >= 2 {
            let values: Vec<f64> = self.progress_state.recent_values.iter().cloned().collect();
            let n = values.len();

            // Linear regression to estimate progress rate
            let x_mean = (n - 1) as f64 / 2.0;
            let y_mean = values.iter().sum::<f64>() / n as f64;

            let mut num = 0.0;
            let mut den = 0.0;

            for (i, &y) in values.iter().enumerate() {
                let x = i as f64;
                num += (x - x_mean) * (y - y_mean);
                den += (x - x_mean).powi(2);
            }

            self.progress_state.progress_rate = if den > 1e-15 { -num / den } else { 0.0 };
        }
    }

    /// Update noise-robust convergence state
    fn update_noise_robust(&mut self, function_value: f64, gradient_norm: f64, step_norm: f64) {
        // Add to windows
        if self.noise_state.function_window.len() >= self.options.noise_window {
            self.noise_state.function_window.pop_front();
        }
        self.noise_state.function_window.push_back(function_value);

        if self.noise_state.gradient_window.len() >= self.options.noise_window {
            self.noise_state.gradient_window.pop_front();
        }
        self.noise_state.gradient_window.push_back(gradient_norm);

        if self.noise_state.step_window.len() >= self.options.noise_window {
            self.noise_state.step_window.pop_front();
        }
        self.noise_state.step_window.push_back(step_norm);
    }

    /// Update plateau detection
    fn update_plateau_detection(&mut self, function_value: f64, iteration: usize) {
        if self.plateau_state.plateau_window.len() >= self.options.plateau_window {
            self.plateau_state.plateau_window.pop_front();
        }
        self.plateau_state.plateau_window.push_back(function_value);

        // Check for plateau
        if self.plateau_state.plateau_window.len() >= self.options.plateau_window {
            let values: Vec<f64> = self.plateau_state.plateau_window.iter().cloned().collect();
            let min_val = values.iter().fold(f64::INFINITY, |a, &b| a.min(b));
            let max_val = values.iter().fold(f64::NEG_INFINITY, |a, &b| a.max(b));

            if (max_val - min_val).abs() < self.options.plateau_tolerance {
                if !self.plateau_state.plateau_detected {
                    self.plateau_state.plateau_detected = true;
                    self.plateau_state.plateau_start_iteration = Some(iteration);
                }
            } else {
                self.plateau_state.plateau_detected = false;
                self.plateau_state.plateau_start_iteration = None;
            }
        }
    }

    /// Check all convergence criteria
    fn check_all_convergence_criteria(
        &self,
        function_value: f64,
        gradient_norm: f64,
        step_norm: f64,
        _iteration: usize,
    ) -> Result<RobustConvergenceResult, OptimizeError> {
        let mut convergence_reasons = Vec::new();
        let mut warning_flags = Vec::new();

        // Get function change
        let function_change = if self.progress_state.recent_values.len() >= 2 {
            let recent: Vec<f64> = self.progress_state.recent_values.iter().cloned().collect();
            recent[recent.len() - 1] - recent[recent.len() - 2]
        } else {
            0.0
        };

        // Check adaptive convergence
        let adaptive_status =
            self.adaptive_state
                .check_convergence(function_change, step_norm, gradient_norm);

        let mut criteria_met = 0;

        // Standard convergence criteria
        if adaptive_status.f_converged {
            convergence_reasons.push("Function tolerance".to_string());
            criteria_met += 1;
        }
        if adaptive_status.x_converged {
            convergence_reasons.push("Step tolerance".to_string());
            criteria_met += 1;
        }
        if adaptive_status.g_converged {
            convergence_reasons.push("Gradient tolerance".to_string());
            criteria_met += 1;
        }

        // Early stopping check
        if self.options.enable_early_stopping {
            let early_stop_triggered = self.early_stop_state.iterations_without_improvement
                >= self.options.early_stopping_patience;

            if early_stop_triggered {
                convergence_reasons.push("Early stopping".to_string());
                criteria_met += 1;
            }
        }

        // Progress-based convergence
        if self.options.enable_progress_based
            && self.progress_state.progress_rate.abs() < self.options.min_progress_rate
        {
            convergence_reasons.push("Insufficient progress".to_string());
            criteria_met += 1;
        }

        // Time limit check
        if self.options.enable_time_limit {
            if let Some(start_time) = self.start_time {
                if start_time.elapsed() > self.options.max_time {
                    convergence_reasons.push("Time limit exceeded".to_string());
                    criteria_met += 1;
                }
            }
        }

        // Noise-robust convergence
        if self.options.enable_noise_robust {
            let noise_converged = self.check_noise_robust_convergence();
            if noise_converged {
                convergence_reasons.push("Noise-robust convergence".to_string());
                criteria_met += 1;
            }
        }

        // Plateau detection
        if self.options.enable_plateau_detection && self.plateau_state.plateau_detected {
            convergence_reasons.push("Plateau detected".to_string());
            criteria_met += 1;
        }

        // Check if convergence is achieved
        let converged = if self.options.require_multiple_criteria {
            criteria_met >= self.options.min_criteria_count
        } else {
            criteria_met > 0
        };

        // Generate warnings
        if self.early_stop_state.iterations_without_improvement
            > self.options.early_stopping_patience / 2
        {
            warning_flags.push("Slow convergence detected".to_string());
        }

        if gradient_norm > 1e3 {
            warning_flags.push("Large gradient _norm".to_string());
        }

        if self.plateau_state.plateau_detected {
            warning_flags.push("Function plateau detected".to_string());
        }

        Ok(RobustConvergenceResult {
            converged,
            convergence_reasons,
            warning_flags,
            adaptive_status,
            criteria_met,
            early_stopping_nit: self.early_stop_state.iterations_without_improvement,
            progress_rate: self.progress_state.progress_rate,
            time_elapsed: self.start_time.map(|t| t.elapsed()),
            plateau_detected: self.plateau_state.plateau_detected,
            noise_robust_confidence: self.calculate_noise_confidence(),
        })
    }

    /// Check noise-robust convergence
    fn check_noise_robust_convergence(&self) -> bool {
        if self.noise_state.function_window.len() < self.options.noise_window {
            return false;
        }

        // Statistical test for convergence stability
        let f_values: Vec<f64> = self.noise_state.function_window.iter().cloned().collect();
        let g_values: Vec<f64> = self.noise_state.gradient_window.iter().cloned().collect();

        // Check if recent values are consistently small (statistically)
        let f_mean = f_values.iter().sum::<f64>() / f_values.len() as f64;
        let f_std = (f_values.iter().map(|x| (x - f_mean).powi(2)).sum::<f64>()
            / f_values.len() as f64)
            .sqrt();

        let g_mean = g_values.iter().sum::<f64>() / g_values.len() as f64;
        let g_std = (g_values.iter().map(|x| (x - g_mean).powi(2)).sum::<f64>()
            / g_values.len() as f64)
            .sqrt();

        // Use confidence interval approach
        let f_margin = f_std * 1.96; // 95% confidence
        let g_margin = g_std * 1.96;

        let f_converged = f_mean.abs() < self.adaptive_state.current_ftol + f_margin;
        let g_converged = g_mean < self.adaptive_state.current_gtol + g_margin;

        f_converged && g_converged
    }

    /// Calculate noise confidence level
    fn calculate_noise_confidence(&self) -> f64 {
        if self.noise_state.function_window.len() < 3 {
            return 0.0;
        }

        let values: Vec<f64> = self.noise_state.function_window.iter().cloned().collect();
        let mean = values.iter().sum::<f64>() / values.len() as f64;
        let variance = values.iter().map(|x| (x - mean).powi(2)).sum::<f64>() / values.len() as f64;

        // Confidence based on coefficient of variation
        let cv = if mean.abs() > 1e-15 {
            variance.sqrt() / mean.abs()
        } else {
            f64::INFINITY
        };

        // Map CV to confidence (0 = perfect, high CV = low confidence)
        (1.0 / (1.0 + cv)).clamp(0.0, 1.0)
    }

    /// Get current adaptive state for compatibility
    pub fn get_adaptive_state(&self) -> &AdaptiveToleranceState {
        &self.adaptive_state
    }
}

/// Comprehensive convergence result with detailed information
#[derive(Debug, Clone)]
pub struct RobustConvergenceResult {
    /// Whether convergence was achieved
    pub converged: bool,
    /// List of reasons for convergence
    pub convergence_reasons: Vec<String>,
    /// Warning flags for potential issues
    pub warning_flags: Vec<String>,
    /// Adaptive convergence status
    pub adaptive_status: ConvergenceStatus,
    /// Number of criteria that were met
    pub criteria_met: usize,
    /// Early stopping iterations count
    pub early_stopping_nit: usize,
    /// Current progress rate
    pub progress_rate: f64,
    /// Time elapsed since start
    pub time_elapsed: Option<Duration>,
    /// Whether plateau was detected
    pub plateau_detected: bool,
    /// Confidence level for noise-robust convergence
    pub noise_robust_confidence: f64,
}

impl RobustConvergenceResult {
    /// Get convergence message
    pub fn get_message(&self) -> String {
        if self.converged {
            if self.convergence_reasons.is_empty() {
                "Optimization converged".to_string()
            } else {
                format!(
                    "Optimization converged: {}",
                    self.convergence_reasons.join(", ")
                )
            }
        } else {
            "Optimization has not converged".to_string()
        }
    }

    /// Get detailed status report
    pub fn get_detailed_report(&self) -> String {
        let mut report = String::new();

        report.push_str(&format!(
            "Convergence Status: {}\n",
            if self.converged {
                "CONVERGED"
            } else {
                "NOT CONVERGED"
            }
        ));

        if !self.convergence_reasons.is_empty() {
            report.push_str(&format!(
                "Convergence reasons: {}\n",
                self.convergence_reasons.join(", ")
            ));
        }

        if !self.warning_flags.is_empty() {
            report.push_str(&format!("Warnings: {}\n", self.warning_flags.join(", ")));
        }

        report.push_str(&format!("Criteria met: {}\n", self.criteria_met));
        report.push_str(&format!("Progress rate: {:.3e}\n", self.progress_rate));

        if let Some(time) = self.time_elapsed {
            report.push_str(&format!(
                "Time elapsed: {:.3} seconds\n",
                time.as_secs_f64()
            ));
        }

        if self.noise_robust_confidence > 0.0 {
            report.push_str(&format!(
                "Noise confidence: {:.1}%\n",
                self.noise_robust_confidence * 100.0
            ));
        }

        report.push_str(&format!(
            "Function tolerance: {:.3e}\n",
            self.adaptive_status.ftol_used
        ));
        report.push_str(&format!(
            "Gradient tolerance: {:.3e}\n",
            self.adaptive_status.gtol_used
        ));
        report.push_str(&format!(
            "Step tolerance: {:.3e}\n",
            self.adaptive_status.xtol_used
        ));

        report
    }
}

/// Create robust convergence options for specific problem types
#[allow(dead_code)]
pub fn create_robust_options_for_problem(
    problem_type: &str,
    problem_size: usize,
    expected_difficulty: &str,
) -> RobustConvergenceOptions {
    let adaptive_tolerance =
        crate::unconstrained::adaptive_convergence::create_adaptive_options_for_problem(
            problem_type,
            problem_size,
        );

    match expected_difficulty.to_lowercase().as_str() {
        "easy" => RobustConvergenceOptions {
            adaptive_tolerance,
            enable_early_stopping: false,
            enable_progress_based: false,
            enable_noise_robust: false,
            require_multiple_criteria: false,
            ..Default::default()
        },
        "moderate" => RobustConvergenceOptions {
            adaptive_tolerance,
            enable_early_stopping: true,
            early_stopping_patience: 15,
            enable_progress_based: true,
            enable_noise_robust: true,
            ..Default::default()
        },
        "difficult" => RobustConvergenceOptions {
            adaptive_tolerance,
            enable_early_stopping: true,
            early_stopping_patience: 30,
            enable_progress_based: true,
            enable_noise_robust: true,
            require_multiple_criteria: true,
            min_criteria_count: 2,
            enable_plateau_detection: true,
            ..Default::default()
        },
        "very_difficult" => RobustConvergenceOptions {
            adaptive_tolerance,
            enable_early_stopping: true,
            early_stopping_patience: 50,
            enable_progress_based: true,
            enable_noise_robust: true,
            require_multiple_criteria: true,
            min_criteria_count: 2,
            enable_plateau_detection: true,
            noise_window: 10,
            noise_confidence: 0.99,
            ..Default::default()
        },
        _ => RobustConvergenceOptions {
            adaptive_tolerance,
            ..Default::default()
        },
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_robust_convergence_initialization() {
        let options = RobustConvergenceOptions::default();
        let mut state = RobustConvergenceState::new(options, 10);
        state.start_timing();

        assert!(state.start_time.is_some());
    }

    #[test]
    fn test_early_stopping() {
        let mut options = RobustConvergenceOptions::default();
        options.enable_early_stopping = true;
        options.early_stopping_patience = 3;
        options.early_stopping_min_delta = 1e-6;

        let mut state = RobustConvergenceState::new(options, 5);

        // Simulate no improvement for several iterations
        for i in 0..5 {
            let result = state
                .update_and_check_convergence(1.0, 1e-3, 1e-6, i, None)
                .expect("Operation failed");

            if i >= 3 {
                assert!(result.converged);
                assert!(result
                    .convergence_reasons
                    .contains(&"Early stopping".to_string()));
            }
        }
    }

    #[test]
    fn test_progress_based_convergence() {
        let mut options = RobustConvergenceOptions::default();
        options.enable_progress_based = true;
        options.min_progress_rate = 1e-8;

        let mut state = RobustConvergenceState::new(options, 5);

        // Simulate very slow progress
        for i in 0..15 {
            let f_val = 1.0 - i as f64 * 1e-10; // Extremely slow decrease
            let result = state
                .update_and_check_convergence(f_val, 1e-3, 1e-6, i, None)
                .expect("Operation failed");

            if i > 10 {
                // Should converge due to insufficient progress
                if result.converged {
                    assert!(result
                        .convergence_reasons
                        .contains(&"Insufficient progress".to_string()));
                    break;
                }
            }
        }
    }

    #[test]
    fn test_noise_robust_convergence() {
        let mut options = RobustConvergenceOptions::default();
        options.enable_noise_robust = true;
        options.noise_window = 5;

        let mut state = RobustConvergenceState::new(options, 5);

        // Simulate noisy convergence
        for i in 0..10 {
            let noise = if i % 2 == 0 { 1e-9 } else { -1e-9 };
            let f_val = 1e-10 + noise; // Converged but noisy
            let g_val = 1e-6 + noise;

            let result = state
                .update_and_check_convergence(f_val, g_val, 1e-8, i, None)
                .expect("Operation failed");

            if i >= 8 && result.converged {
                assert!(result
                    .convergence_reasons
                    .iter()
                    .any(|r| r.contains("Noise-robust") || r.contains("tolerance")));
                break;
            }
        }
    }

    #[test]
    fn test_multiple_criteria_requirement() {
        let mut options = RobustConvergenceOptions::default();
        options.require_multiple_criteria = true;
        options.min_criteria_count = 2;
        options.adaptive_tolerance.initial_ftol = 1e-6;
        options.adaptive_tolerance.initial_gtol = 1e-4;
        options.adaptive_tolerance.initial_xtol = 1e-3;
        // Disable other convergence criteria to test only basic tolerances
        options.enable_early_stopping = false;
        options.enable_progress_based = false;
        options.enable_plateau_detection = false;
        options.enable_noise_robust = false;

        let mut state = RobustConvergenceState::new(options, 5);

        // Only satisfy one criterion (function tolerance)
        let result = state
            .update_and_check_convergence(1e-8, 1e-1, 1e-2, 10, None)
            .expect("Operation failed");

        // Should not converge with only one criterion met
        assert!(result.criteria_met < 2);
    }

    #[test]
    fn test_plateau_detection() {
        let mut options = RobustConvergenceOptions::default();
        options.enable_plateau_detection = true;
        options.plateau_window = 5;
        options.plateau_tolerance = 1e-10;

        let mut state = RobustConvergenceState::new(options, 5);

        // Simulate plateau
        for i in 0..10 {
            let result = state
                .update_and_check_convergence(1.0, 1e-3, 1e-6, i, None)
                .expect("Operation failed");

            if i >= 6 {
                assert!(result.plateau_detected);
                if result.converged {
                    assert!(result
                        .convergence_reasons
                        .contains(&"Plateau detected".to_string()));
                }
            }
        }
    }

    #[test]
    fn test_problem_specific_options() {
        let easy = create_robust_options_for_problem("well_conditioned", 10, "easy");
        assert!(!easy.enable_early_stopping);
        assert!(!easy.require_multiple_criteria);

        let difficult = create_robust_options_for_problem("ill_conditioned", 100, "difficult");
        assert!(difficult.enable_early_stopping);
        assert!(difficult.require_multiple_criteria);
        assert_eq!(difficult.min_criteria_count, 2);

        let very_difficult = create_robust_options_for_problem("noisy", 1000, "very_difficult");
        assert!(very_difficult.enable_noise_robust);
        assert_eq!(very_difficult.noise_window, 10);
        assert_eq!(very_difficult.early_stopping_patience, 50);
    }

    #[test]
    fn test_detailed_report() {
        let options = RobustConvergenceOptions::default();
        let mut state = RobustConvergenceState::new(options, 5);

        let result = state
            .update_and_check_convergence(1e-10, 1e-8, 1e-10, 10, None)
            .expect("Operation failed");

        let report = result.get_detailed_report();
        assert!(report.contains("Convergence Status:"));
        assert!(report.contains("Function tolerance:"));
        assert!(report.contains("Gradient tolerance:"));
    }
}